2612233
Fingerprint enhancement with dyadic scale-space
Fingerprint enhancement is a critical step in automatic fingerprint verification system. Most of the existing enhancement uses a set of contextual filters to enhance fingerprint. The main drawback of these methods is these contextual filters based on the local information of the fingerprint, such as ridge width, orientation, curvature etc. This information is unreliable in the areas corrupted by the noise. This paper introduces the scale space theory in the computer vision to enhance the fingerprint. In the enhancement process, decompose fingerprint into a series of images and organize the images by courser to finer scheme. Thus a globe and integrate interpretation is available and it enables us to get rid of the influence of noise to the largest extent. Experiments show our algorithm is fast and improve the performance of fingerprint verification system.
46662719
A minutiae matching algorithm in fingerprint verification
Fingerprint matching is one of the most important problems in AFIS. In general, we use minutiae such as ridge endings and ridge bifurcation to represent a fingerprint and do fingerprint matching through minutiae matching. We propose a minutiae matching algorithm which modified Jain et al.'s algorithm (1997). Our algorithm can better distinguish two images from different fingers and is more robust to nonlinear deformation. Experiments done on a set of fingerprint images captured with an inkless scanner shows that our algorithm is fast and has high accuracy.
206622046
Fingerprint Alignment Using Similarity Histogram
The performance of fingerprint matching algorithm relies heavily on the accuracy of fingerprint alignment. Falsely aligning two feature sets extracted from two finger images of a fingerprint will increase the false rejection rate (FRR). In order to improve the performance of fingerprint matching algorithm, we present a new fingerprint alignment algorithm called similarity histogram approach (SHA). First, we calculate the local similarity matrix based on minutiae and associate ridges between two fingerprints. Then, similarity histograms of transformation parameters are constructed from local similarity matrix. In the end, the optimal transformation parameters are obtained using a statistical method. Experimental results on FVC databases show that our method is effective and reliable.
31563264
Fingerprint Minutiae Matching with Orientation and Ridge
An important step in automatic fingerprint identification system (AFIS) is fingerprint matching. The task of fingerprint matching is to verify whether two fingerprints are coming from same finger. In this paper we detail and discuss the fingerprint matching algorithm. A minutia matching algorithm is proposed which modified the algorithm presented by Jain et al. In this algorithm, in order to reduce the effect of noise and false minutiae, block orientation and ridge information are introduced into the minutiae-based matching algorithm in a simple but reliable way. Ridge information which is some sampled points in the ridge are used to align two fingerprints, in order to avoid misalign two fingerprints, we use block orientation to correct the ridge alignment. Experiments on the database FVC2002 show the performance.
34795143
Automatic Fingerprint Identification Using Cluster Algorithm
30175148
Fingerprint enhancement with dyadic scale-space
Fingerprint enhancement is a critical step in fingerprint identification. Most of the existing enhancement uses a set of contextual fillers to enhance fingerprint. The main drawback of these methods is these contextual filters based on the local information of the fingerprint, such as ridge width, orientation, curvature et al. These information are unreliable in the areas corrupted by the noise. This paper introduces the scale space theory in the computer vision to enhance the fingerprint. In the enhancement process, decompose fingerprint into a series of images and organize the images by finer to coarser scheme. Thus a globe and integrate interpretation is available and it enable us to get rid of the influence of noise to the largest extent. Experiments show our algorithm is fast and has excellent performance.
25090129
Comments on "A translation- and scale-invariant adaptive wavelet transform"
Xiong et al. presented a translationand scale-invariant adaptive wavelet transform. We show that their renormalized signal (pre-wavelet transform) is already translation- and scale-invariant. Thus, it is not just invariant under the wavelet transform. We give a necessary and sufficient condition for renormalized signals to be affine transform invariant.
16987100
Measuring Prime Program Complexity
Abstract This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity. This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative terms, and empirical means can be used to validate the assumptions used to develop the model. As a graph-based model, it can be applied to several graphical examples as extensions not otherwise available to source-code based models. This paper introduces the measure, derives several properties for it, and gives some simple examples to demonstrate that the measure is a plausible approximation of our notions concerning structured programming.
15843550
Evaluating Web software reliability based on workload and failure data extracted from server logs
We characterize usage and problems for Web applications, evaluate their reliability, and examine the potential for reliability improvement. Based on the characteristics of Web applications and the overall Web environment, we classify Web problems and focus on the subset of source content problems. Using information about Web accesses, we derive various measurements that can characterize Web site workload at different levels of granularity and from different perspectives. These workload measurements, together with failure information extracted from recorded errors, are used to evaluate the operational reliability for source contents at a given Web site and the potential for reliability improvement. We applied this approach to the Web sites www.seas.smu.edu and www.kde.org. The results demonstrated the viability and effectiveness of our approach.
16586772
A new state-space approach for super-resolution image sequence reconstruction
Super-resolution imaging is to overcome the inherent limitations of image acquisition to create high-resolution images from their low-resolution counterparts. In this paper, a novel state-space approach is proposed to incorporate the temporal correlations among the low-resolution observations into the framework of the Kalman filtering. The proposed approach exploits both the temporal correlations information among the high-resolution images and the temporal correlations information among the low-resolution images to improve the quality of the reconstructed high-resolution sequence. Experimental results show that the proposed framework is superior to bi-linear interpolation, bi-cubic spline interpolation and the conventional Kalman filter approach, due to the consideration of the temporal correlations among the low-resolution images.
39882874
A comparison of measurement and defect characteristics of new and legacy software systems
Abstract This paper compares the quality characteristics of a large legacy software system and a new one. Defect fixes applied to specific modules during testing are used as the direct quality metric. Indirect quality indicators used in this paper include software metrics of various product and process attributes, including design, size, change, and complexity. We analyze and compare the measurement results by examining their individual distributions, the correlations between defects and quality indicators, and tree-based models linking defects to quality indicators. In both these systems, most of the defects are found to be concentrated on relatively few high-defect modules, which points to the need for appropriate risk identification techniques so that defect removal effort can be focused on those high-defect modules for effective quality improvement. In addition, defects in the legacy system are more closely related to change and data complexity metrics; while defects in the new system are more closely related to various design metrics. These results demonstrate different measurement characteristics for these two types of software systems, and suggest that different quality analysis and improvement methods may be more appropriate and effective for different kinds of software systems.