Fingerprint recognition is a method of biometric authentication that uses pattern recognition techniques [1] based on high-resolution fingerprints images of the individual. Fingerprints have been used in forensic as w...
详细信息
Fingerprint recognition is a method of biometric authentication that uses pattern recognition techniques [1] based on high-resolution fingerprints images of the individual. Fingerprints have been used in forensic as well as commercial applications for identification as well as verification. The fingerprint surface is made up of a system of ridges and valleys. The steps for Fingerprint recognition include image acquisition, preprocessing, feature extraction and matching [2]. In the present work, a new fingerprint feature detection algorithm has been proposed. It has been found that presence of noise in fingerprint images leads to spurious minutiae. To overcome this problem, feature extraction has been done which efficiently determine the minutiae points in fingerprint [1]. The proposed method can be used in matching the template for finding bifurcation and termination. The new smoothing algorithm is proposed for the detection of the features of fingerprints. A method has been introduced for finding ridges in the fingerprint image with the help of eight different masks. It is a process of making a binary image of ridges from the grayscale fingerprint image. The experimental results showed the accuracy of the algorithm in terms of genuine acceptance rate, false rejection rate, false acceptance rate.
In this paper, a low-complexity symbol detector is presented targeting the emerging 3GPP LTE and WiMAX standards. The detector is the VLSI implementation of a novel MIMO detection algorithm recently proposed. Compared...
详细信息
In this paper, a low-complexity symbol detector is presented targeting the emerging 3GPP LTE and WiMAX standards. The detector is the VLSI implementation of a novel MIMO detection algorithm recently proposed. Compared to the design in the reference, the detector performs better while consumes less silicon area. Including a microcode controlled channel preprocessing unit and a pipelined detection unit, it is flexible enough to cover different standards and transmission schemes while maintaining the power and area efficiency. Implemented using 65 nm CMOS process, the detector can support real-time detection of 20 MHz bandwidth 3GPP LTE or 10 MHz WiMAX downlink physical channel.
A new concept for change detection algorithm for urban areas affected by earthquake is here presented. It is characterized as applicable to just one post-event amplitude Synthetic Aperture Radars (SAR) image and emplo...
详细信息
A new concept for change detection algorithm for urban areas affected by earthquake is here presented. It is characterized as applicable to just one post-event amplitude Synthetic Aperture Radars (SAR) image and employs the inversion of sound scattering models already introduced in literature by the same authors. Aim of the algorithm is to try obtaining fast mapping of damaged areas and provide a first, even rough, evaluation of damage reported. In particular in this paper the overall block diagram chain and the algorithm rationale behind that framework are introduced and discussed in details. Some preliminary results are presented and the performance analyzed. New possible applications based on similar rationale are also commented.
Gathering is an important incident of video surveillance, possibly reflecting the properties of mass disturbances. However, the incident is more difficult to detect than single-object incidents since it always has mul...
详细信息
Gathering is an important incident of video surveillance, possibly reflecting the properties of mass disturbances. However, the incident is more difficult to detect than single-object incidents since it always has multiple detected objects. This paper proposes a plane geometry model to describe the position, trajectory and outline of the detected objects. Gathering incident is checked by a circle in which there are multiple objects. A brief detection algorithm is designed to draw a circle and check whether gathering happens. Finally, several public surveillance videos are tested, and the results indicate the proposed model is efficient, high-detection-rate and robust.
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scale-selection algorithms with spatial regularization. To this end, we formulate scale-selection as a graph labelin...
详细信息
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scale-selection algorithms with spatial regularization. To this end, we formulate scale-selection as a graph labeling problem and employ Markov random field multi-label optimization. We focus on detecting the scales of vascular structures in medical images. We compare the detected vessel scales using our method to those obtained using the selection approach of the well-known vesselness filter (Frangi et al 1998). We propose and discuss two different approaches for evaluating the goodness of scale-selection. Our results on 40 images from the Digital Retinal Images for Vessel Extraction (DRIVE) database show an average reduction in these error measurements by more than 15%.
Cooperative relaying has been shown as a promising approach to leverage the transmit diversity that is traditionally realized by installing multiple antennas on a single device. In digital relaying, one of the key iss...
详细信息
ISBN:
(纸本)9781424425181;9781424425198
Cooperative relaying has been shown as a promising approach to leverage the transmit diversity that is traditionally realized by installing multiple antennas on a single device. In digital relaying, one of the key issues is that relays might receive in error, resulting in error propagation to the destination. Despite error detection codes can be used to prevent error propagation, performing error detection algorithms incurs delay and processing overhead at relays. An alternative approach is to set a threshold value, whereby the relay forwards when the instantaneous signal-to-noise ratio (SNR) exceeds the threshold. Most existing threshold-based relaying schemes implicitly assume the relays are placed in the middle between the source and the destination, whereby a single threshold is applied to the source-relay channel for making the cooperation decision. In infrastructureless wireless networks, relays may be randomly distributed in the network and thus, the relaying scheme based on a single threshold may choose the relay with a weak one-hop channel to forward that degrades diversity combining. In this paper, a threshold digital relaying scheme based on double testing is proposed where both the source-relay and the relay-destination channels are tested to select the cooperating relays. The end-to-end bit error rate (BER) performance is derived theoretically, and compared with simulation results. Different network topologies are considered to demonstrate the superior performance of the proposed double testing digital relaying scheme over the single testing schemes.
Human-machine interaction (HMI) relies on pattern recognition algorithms that are not perfect. To improve the performance and usability of these systems we can utilize the neural mechanisms in the human brain dealing ...
详细信息
Human-machine interaction (HMI) relies on pattern recognition algorithms that are not perfect. To improve the performance and usability of these systems we can utilize the neural mechanisms in the human brain dealing with error awareness. This study aims at designing a practical error detection algorithm using electroencephalogram signals that can be integrated in an HMI system. Thus, real-time operation, customization, and operation convenience are important. We address these requirements in an experimental framework simulating machine errors. Our results confirm the presence of brain potentials related to processing of machine errors. These are used to implement an error detection algorithm emphasizing the differences in error processing on a per subject basis. The proposed algorithm uses the individual best bipolar combination of electrode sites and requires short calibration. The single-trial error detection performance on six subjects, characterized by the area under the ROC curve ranges from 0.75 to 0.98.
To improve the bandwidth efficiency of the classical orthogonal cooperative transmission scheme while maintaining the cooperative gain, a novel non-orthogonal amplify-and-forward cooperative scheme based on distribute...
详细信息
To improve the bandwidth efficiency of the classical orthogonal cooperative transmission scheme while maintaining the cooperative gain, a novel non-orthogonal amplify-and-forward cooperative scheme based on distributed space-time code is proposed. In this scheme, the orthogonal characteristic of Alamouti space-time code is utilized to make cooperative users relay on the shared channel resources so that better bandwidth efficiency can be achieved. Maximum likelihood (ML) and linear detection algorithms are then devised for the destination node. Theoretical and simulation results show that with a specified spectral efficiency, the proposed scheme outperforms the classical scheme in terms of capacity, outage probability and bit error rate (BER) performance.
This paper presents a simulation study that evaluated one optimal and several near-optimal algorithms for detecting 16-QAM and 64-QAM symbols in single-user MIMO receivers. The study is part of a larger project to dev...
详细信息
This paper presents a simulation study that evaluated one optimal and several near-optimal algorithms for detecting 16-QAM and 64-QAM symbols in single-user MIMO receivers. The study is part of a larger project to develop efficient and near-optimal MIMO detection algorithms for high-order symbol constellations. Fouladi Fard's near-optimal detection algorithm differs from the conventional V-BLAST algorithm by considering each possible value of the noisiest symbol in the current symbol vector, and then performing V-BLAST in parallel for each candidate to detect the remaining symbols. We investigated modifications of Fouladi Fard's algorithm that restrict the search space for the first (noisiest) symbol, thereby reducing the computational complexity while still producing performance that significantly exceeds that of V-BLAST.
Compared with FFT (Fast Fourier Transform), only addition and subtraction operations are involved in FMT (Fast M-sequence Transform). In this paper, three classes of fast correlation algorithms for Gold large sets of ...
详细信息
Compared with FFT (Fast Fourier Transform), only addition and subtraction operations are involved in FMT (Fast M-sequence Transform). In this paper, three classes of fast correlation algorithms for Gold large sets of Kasami sequences are proposed, where FMT is used for fast computation instead of FFT. Analytic results show that computational complexity can be greatly reduced by V-FMT Class and U-FMT Class algorithms. These proposed correlation algorithms with possible applications in low spectral density wireless communications such as the DS/CDMA system.
暂无评论