Analysis and matching of degraded and noisy fingerprints

Emre Kaymaz; Sunanda Mitra

doi:10.1117/12.139096

12 January 1993 Analysis and matching of degraded and noisy fingerprints

Emre Kaymaz, Sunanda Mitra

Proceedings Volume 1771, Applications of Digital Image Processing XV; (1993) https://doi.org/10.1117/12.139096
Event: San Diego '92, 1992, San Diego, CA, United States

Abstract

The present work reports a three stage matching algorithm for latent fingerprints. The algorithm includes preprocessing by a transform domain filter, computation of moments as invariant features and finally, use of a nearest neighbor clustering analysis for fingerprint matching. The transform domain filter involves selective amplification of the spectral band containing the highest energy, and subsequent use of a band-pass filter. The enhanced image is almost noise-free, and shows prominent features in the fingerprint that cannot be extracted by other conventional enhancement techniques. The moments of enhanced fingerprints provide invariant features. The classification of fingerprints is performed by a nearest neighbor clustering of the moment features characterizing a specific fingerprint.

Citation Download Citation

Emre Kaymaz and Sunanda Mitra "Analysis and matching of degraded and noisy fingerprints", Proc. SPIE 1771, Applications of Digital Image Processing XV, (12 January 1993); https://doi.org/10.1117/12.139096

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available