Corners are important image features whose detection is very important in many computer vision tasks. In this paper we have evaluated the performance of five intensity based corner detectors with the help of a dozen t...
详细信息
Corners are important image features whose detection is very important in many computer vision tasks. In this paper we have evaluated the performance of five intensity based corner detectors with the help of a dozen test images, artificial and real, based on six performance measures of which three are proposed by us. We then propose a new approach, using bitplane decomposition, in which a grayscale image is first divided into several bit-planes, and then the original corner detectors are applied on all the bit-planes simultaneously and finally using a threshold, all the higher bit-plane corners are recombined up to the thresholded bit-plane to obtain the final set of corners. Using this approach, we have seen that the performance of the algorithms has improved significantly with respect to both detection and time.
It is well-known that the brain is a complex network""brain areas dedicated to different functions. As such,""consisting of""it is natural to shift toward brain network from brain mapping...
详细信息
It is well-known that the brain is a complex network""brain areas dedicated to different functions. As such,""consisting of""it is natural to shift toward brain network from brain mapping for deeper understanding of brain functions. Although graph theoretical network metrics measuring global or local properties of network topology have been used to investigate the brain network, they do no provide any information about intermediate scale of the brain network, which is provided by the community structure analysis.""In this paper, we propose a method to compare different community detection algorithms for multiple subjects data in terms of the agreement of a group-based community structure with individual community structures. As it is crucial to find a single group-based community structure for a group of subjects to discuss about brain areas and connections, a number of algorithms based on different approaches have been proposed. To show the feasibility of the method for comparing different algorithms, two community detection algorithms based on different approaches ("virtual-typical-subject" and "group analysis") were examined. The Normalized Mutual Information was computed to measure similarity between the group-based community structure and individual community structures derived from resting-state fMRI functional network, and was used for comparing the two algorithms. Our method demonstrated that the algorithm based on the group-analysis approach detected a group-based community structure with greater agreement with individual community structures.
To explain super resolution focusing achieved in time reversal, matched field processing (TR/MFP), an analytical multipath model based on geometric optics approximation with strong total internal reflections was prese...
详细信息
To explain super resolution focusing achieved in time reversal, matched field processing (TR/MFP), an analytical multipath model based on geometric optics approximation with strong total internal reflections was presented in A. Asif and Q. Bai, (2006). This paper uses the multipath model to derive the system response matrix in TRTMFP and exploits the structure of the response matrix to develop detection algorithms for determining the number and locations of passive targets embedded in a random medium. Experimental results prove the accuracy of the algorithms in detecting passive targets
The performance of two major Radio Frequency Interference (RFI) detection algorithms is compared. The peak detection algorithm and the kurtosis detection algorithm are characterized using the receiver operating charac...
详细信息
The performance of two major Radio Frequency Interference (RFI) detection algorithms is compared. The peak detection algorithm and the kurtosis detection algorithm are characterized using the receiver operating characteristic (ROC) for pulsed sinusoid RFI. Downlink data bandwidth is one of the major design factors to be considered when comparing detection algorithms. Results are presented in this paper that compare the kurtosis algorithm performance with an ideally matched peak detection algorithm. The RFI parameters are also varied to analyze the overall detection performance of both algorithms. Factors such as implementation details, resource usage, post-processing and practicality are also addressed for both algorithms.
A comparative performance study of seven pitch detection algorithms was conducted. A speech data base, consisting of eight utterances spoken by 3 males, 3 females, and 1 child was constructed. Telephone, close talking...
详细信息
A comparative performance study of seven pitch detection algorithms was conducted. A speech data base, consisting of eight utterances spoken by 3 males, 3 females, and 1 child was constructed. Telephone, close talking microphone, and wideband recordings were made of each of the utterances. For each of the utterances in the data base a "standard" pitch contour was semiautomaticallly measured using a highly sophisticated interactive pitch detection program. The "standard" pitch contour was then compared with the pitch contour that was obtained from each of the seven programmed pitch detectors. The algorithms used in this study were (1) a center clipping, infinite-peak clipping, modified autocorrelation method, (2) the cepstral method, (3) the SIFT method, (4) the parallel processing time domain method, (5) the data reduction method, (6) a spectral flattening LPC method, and (7) the AMDF method. A set of measurements was made on the pitch contours to quantify the various types of errors which occur in each of the above methods. Included among the error measurements were the average and standard deviation of the error in pitch period during voiced regions, the number of gross errors in the pitch period, and the number of voiced-unvoiced classification errors. For each of the error measurements, the individual pitch detectors could be rank ordered as a measure of their relative performance as a function of recording condition, and pitch range of the various speakers. Results are presented on rankings based on one category of errors.
Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform their outputs if the input network is slight...
详细信息
Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform their outputs if the input network is slightly modified. The instabilities appear to be important and we propose a modification of one algorithm to stabilize it and to allow the tracking of the communities in an evolving network. This modification has one parameter which is a tradeoff between stability and quality. The resulting algorithm appears to be very effective. We finally use it on an evolving network of blogs.
Several detection algorithms for the vertical Bell Laboratories layered space time (V-BLAST) system are compared. We propose the concept of segmented detection on the observation that the overall performance of decisi...
详细信息
ISBN:
(纸本)0780382552
Several detection algorithms for the vertical Bell Laboratories layered space time (V-BLAST) system are compared. We propose the concept of segmented detection on the observation that the overall performance of decision feedback equalization (DFE) is limited by the performance of the first detected subchannel. We perform maximum-likelihood (ML) detection for the first several subchannels and use the DFE procedure to detect the remaining subchannels. Also, we propose a novel segmented detection algorithm based on the minimum mean square error (MMSE) criterion. Compared with DFEs, segmented detection improves the detection performance with little increase of complexity. Computer simulation verifies it.
This paper considers the problem of algorithm selection for community detection. The aim of community detection is to identify sets of nodes in a network which are more interconnected relative to their connectivity to...
详细信息
This paper considers the problem of algorithm selection for community detection. The aim of community detection is to identify sets of nodes in a network which are more interconnected relative to their connectivity to the rest of the network. A large number of algorithms have been developed to tackle this problem, but as with any machine learning task there is no “one-size-fits-all” and each algorithm excels in a specific part of the problem space. This paper examines the performance of algorithms developed for weighted networks against those using unweighted networks for different parts of the problem space (parameterised by the intra/inter community links). It is then demonstrated how the choice of algorithm (weighted/unweighted) can be made based only on the observed network.
Fundamental frequency estimation is one of the most important issues in the field of speech processing. An accurate estimate of the fundamental frequency plays a key role in the field of speech and music analysis. So ...
详细信息
ISBN:
(纸本)9781728111957;9781728111940
Fundamental frequency estimation is one of the most important issues in the field of speech processing. An accurate estimate of the fundamental frequency plays a key role in the field of speech and music analysis. So far, various methods have been proposed in the time- and frequency-domain. However, the main challenge is the strong noises in speech signals. In this paper, to improve the accuracy of fundamental frequency estimation, we propose a method for optimal combination of fundamental frequency estimation methods, in noisy signals. In this method, to discriminate voiced frames from unvoiced frames in a better way, the Voiced/Unvoiced (V/U) scores of four pitch detection methods are combined linearly. These methods are: Autocorrelation, Yin, YAAPT and SWIPE. After identifying the Voiced/Unvoiced label of each frame, the fundamental frequency (F 0 ) of the frame is estimated using the SWIPE method. The optimal coefficients for linear combination are determined using the regularized least squares method with Tikhonov regularization. To evaluate the proposed method, 10 speech files (5 female and 5 male voices) are selected from the PTDB-TUG standard database and the results are presented in terms of SDFPE, GPE, VDE, PTE and FFE standard error criteria. The results indicate that our proposed method relatively reduced the aforementioned criteria (averaged in various SNRs) by 27.13%, 22.14%, 17.40% and 26.74% respectively, which demonstrate the effectiveness of the proposed method in comparison to state-of-the-art methods.
暂无评论