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.
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.
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.
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.
8746493
Fingerprint Enhancement Using Oriented Diffusion Filter
Fingerprint enhancement is a critical step in a fingerprint identification system. Recently, some anisotropic nonlinear diffusion filter is applied to the fingerprint preprocessed. Impressive results are main reason for using nonlinear diffusion filtering in image processing. Poor efficiency, especially the computational load, is the main reason for not using nonlinear diffusion filtering. In order to improve the efficiency, a novel piecewise nonlinear diffusion for fingerprint enhancement is presented. It shows anisotropic diffusion equation using diffusion tensor which continuously depends on the gradient is not necessary to smooth the fingerprint. We simplify the anisotropic nonlinear-diffusion in order to satisfy a real-time fingerprint recognition system. According to the local character of the fingerprint, the diffusion filter is steered by the orientation of ridge. Experimental results illustrate that our enhancement algorithm can satisfy the requirement of an AFIS.
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.
10468208
Measurement and defect modeling for a legacy software system
This paper analyzes the quality of a large-scale legacy software system using selected metrics. Quality measurements include defect information collected during product development and in-field operation. Other software metrics include measurements on various product and process attributes, including design, size, change, and complexity. Preliminary analyses revealed the high degree of skew in our data and a weak correlation between defects and software metrics. Tree-based models were then used to uncover relationships between defects and software metrics, and to identify high-defect modules together with their associated measurement characteristics. As results presented in tree forms are natural to the decision process and are easy to understand, tree-based modeling is shown to be suitable for change solicitation and useful in guiding remedial actions for quality improvement.
29205217
Improving the Reliability of Object-Oriented Software through Object-Level Behavioral Simulation
In this paper we propose an Object-level Behavior Simulation Model (OBSM) that simulates the behavior of each object according to the message pattern exhibited by behavioral design pattern to verify it for its correctness. The model evaluates the existing reliability of the object-oriented software and allows developer to improve it during early phases of the development.
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.
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.