Article

Fingerprint image enhancement: algorithm and performance evaluation

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI
IEEE Transactions on Pattern Analysis and Machine Intelligence (Impact Factor: 4.8). 09/1998; DOI: 10.1109/34.709565
Source: CiteSeer

ABSTRACT In order to ensure that the performance of an automatic
fingerprint identification/verification system will be robust with
respect to the quality of input fingerprint images, it is essential to
incorporate a fingerprint enhancement algorithm in the minutiae
extraction module. We present a fast fingerprint enhancement algorithm,
which can adaptively improve the clarity of ridge and valley structures
of input fingerprint images based on the estimated local ridge
orientation and frequency. We have evaluated the performance of the
image enhancement algorithm using the goodness index of the extracted
minutiae and the accuracy of an online fingerprint verification system.
Experimental results show that incorporating the enhancement algorithm
improves both the goodness index and the verification accuracy

18 Bookmarks
 · 
865 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Fingerprint verification of online fingerprint images has become a very actively studied field in biometric systems. This paper investigates the major challenges in fingerprint recognition if the images are captured at varying pressure. Extracting minutiae from fingerprint images is one of the most important steps in automatic fingerprint verification and classification. Minutiae are local discontinuities in the fingerprint images, mainly ridge termination and bifurcations. In this paper we proposed an algorithm m-margin to fill the broken curves on a fingerprint. Our proposed algorithm eliminates false minutiae that connect broken curves in fingerprint. The method is initialized with the captured image using local histogram equalization, FFT, image binarization, thinning, skeleton refinement, end-points, filtering and matching. The images achieved from these steps are passed through proposed m-margin algorithm. This method show some improvement in the minutiae extraction process in terms of either efficiency and/or time required. The quality of the fingerprint images greatly affects the performance of the minutiae extraction.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Distributed processing offers a way of successfully dealing with computationally demanding applications such as scientific problems. Over the years, researchers have investi-gated ways to predict the performance of parallel algorithms. Amdahl's law states that the speedup of any parallel program has an upper bound which is determined by the amount of time spent on the sequential fraction of the program, no matter how small and regardless of the number of processing nodes used. This research discusses some of the short comings of this law in the current age. We propose a theoretical model for predicting the behavior of a distributed algorithm given the network restrictions of the cluster used. The paper focuses on the impact of latency and bandwidth which affect the cost of interprocessor communication and the number of processing nodes used to predict the performance. The model shows good accuracy in comparison to Amdahl's law.
    Proceedings of the World Congress on Engineering, London; 07/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Computationally demanding applications can benefit from distributed processing. Distributed processing offers immerse computational power from collections of autonomous systems which can provide up to thousands of processing cores. Over the years, a considerable amount of research has been put towards developing performance prediction models for distributed applications. Amdahl's law states that the speedup of any parallel program has an upper bound which is determined by the amount of time spent on the sequential fraction of the program, no matter how small and regardless of the number of processing nodes used. This paper discusses some of the short comings of this law in the current age. We propose a theoretical model for predicting the behavior of a distributed algorithm given the network restrictions of the cluster used. The paper focuses on the impact of latency and bandwidth which affect the cost of interprocessor communication and the number of processing nodes used to predict the performance. The model shows good accuracy in comparison to Amdahl's law.
    IAENG International Journal of Computer Science 08/2012; 39(3):312-320.

Full-text (2 Sources)

Download
47 Downloads
Available from
Nov 24, 2014