A Systematic Approach For Feature Extraction in Fingerprint Images Sharat Chikkerur, Chaohang Wu, Venu Govindaraju

Slides:



Advertisements
Similar presentations
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Advertisements

ONLINE FINGERPRINT VERIFICATION
Prénom Nom Document Analysis: Document Image Processing Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
嵌入式視覺 Feature Extraction
Computer Vision Lecture 16: Texture
Fingerprint recognition using MATLAB (using minutiae matching) Graduation project Prepared by: Zain S. Barham Supervised by: Dr. Allam Mousa.
Computer Vision Lecture 16: Region Representation
Segmentation (2): edge detection
January 21, Fingerprint Identification BIOM 426 Instructor: Natalia A. Schmid.
A Review of “Adaptive fingerprint image enhancement with fingerprint image quality analysis”, by Yun & Cho Malcolm McMillan.
EE 7740 Fingerprint Recognition. Bahadir K. Gunturk2 Biometrics Biometric recognition refers to the use of distinctive characteristics (biometric identifiers)
66: Priyanka J. Sawant 67: Ayesha A. Upadhyay 75: Sumeet Sukthankar.
Sreya Chakraborty Under the guidance of Dr. K. R. Rao Multimedia Processing Lab (MPL) University of Texas at Arlington.
6/9/2015Digital Image Processing1. 2 Example Histogram.
Automatic Fingerprint Matching System Hsing-Hua Yu and Chaur-Chin Chen Department of Computer Science National Tsing Hua University Hsinchu 30013, Taiwan.
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
Good quality Fingerprint Image Minutiae Feature Extraction
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
Segmentation (Section 10.2)
Pores and Ridges: High- Resolution Fingerprint Matching Using Level 3 Features Anil K. Jain Yi Chen Meltem Demirkus.
Feature Screening Concept: A greedy feature selection method. Rank features and discard those whose ranking criterions are below the threshold. Problem:
Implementation of An Automatic Fingerprint Identification System Peihao Huang, Chia-Yung Chang, Chaur-Chin Chen Department of Computer Science National.
Automatic Fingerprint Verification Principal Investigator Venu Govindaraju, Ph.D. Graduate Students T.Jea, Chaohang Wu, Sharat S.Chikkerur.
A Framework for Feature Extraction Algorithms for Automatic Fingerprint Recognition Systems Chaohong Wu Center for Unified.
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT Project Members Sanyam Sharma Sunil Mohan Ranta Group No FINGERPRINT.
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Orthogonal moments Motivation for using OG moments Stable calculation by recurrent relations Easier and stable image reconstruction - set of orthogonal.
1 SEGMENTATION OF BREAST TUMOR IN THREE- DIMENSIONAL ULTRASOUND IMAGES USING THREE- DIMENSIONAL DISCRETE ACTIVE CONTOUR MODEL Ultrasound in Med. & Biol.,
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
SVCL Automatic detection of object based Region-of-Interest for image compression Sunhyoung Han.
Fingerprint Analysis (part 2) Pavel Mrázek. Local ridge frequency.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
1 Fingerprint Analysis and Representation Handbook of Fingerprint Recognition Chapter III Sections 1-6 Presentation by: Tamer Uz Adaptive Flow Orientation.
Medical Image Analysis Image Reconstruction Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
HP-PURDUE-CONFIDENTIAL Final Exam May 16th 2008 Slide No.1 Outline Motivations Analytical Model of Skew Effect and its Compensation in Banding and MTF.
Object Detection with Discriminatively Trained Part Based Models
Automatic Minirhizotron Root Image Analysis Using Two-Dimensional Matched Filtering and Local Entropy Thresholding Presented by Guang Zeng.
Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Supervised Learning of Edges and Object Boundaries Piotr Dollár Zhuowen Tu Serge Belongie.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Image Segmentation and Edge Detection Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng.
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT Project Members Sanyam Sharma Sunil Mohan Ranta Group No FINGERPRINT.
Halftoning With Pre- Computed Maps Objective Image Quality Measures Halftoning and Objective Quality Measures for Halftoned Images.
EE 7740 Fingerprint Recognition. Bahadir K. Gunturk2 Biometrics Biometric recognition refers to the use of distinctive characteristics (biometric identifiers)
1 Iris Recognition Ying Sun AICIP Group Meeting November 3, 2006.
Associative Hierarchical CRFs for Object Class Image Segmentation
Non-Ideal Iris Segmentation Using Graph Cuts
1 Machine Vision. 2 VISION the most powerful sense.
Digital Image Processing
Wonjun Kim and Changick Kim, Member, IEEE
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Performance Measurement of Image Processing Algorithms By Dr. Rajeev Srivastava ITBHU, Varanasi.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Digital Image Processing CSC331
Image Quality Measures Omar Javed, Sohaib Khan Dr. Mubarak Shah.
Chapter 6 Skeleton & Morphological Operation. Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
RECONSTRUCTION OF MULTI- SPECTRAL IMAGES USING MAP Gaurav.
Implementation of An Automatic Fingerprint Identification System
A 2 veto for Continuous Wave Searches
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
FINGER PRINT RECOGNITION USING MINUTIAE EXTRACTION FOR BANK LOCKER SECURITY Presented by J.VENKATA SUMAN ECE DEPARTMENT GMRIT, RAJAM.
Improving the Performance of Fingerprint Classification
Detection of Regions of Interest
Computer Vision Lecture 16: Texture II
Presentation transcript:

A Systematic Approach For Feature Extraction in Fingerprint Images Sharat Chikkerur, Chaohang Wu, Venu Govindaraju

Abstract  A new enhancement algorithm based on Fourier domain analysis is proposed.  Fourier analysis is used extract orientation, frequency and quality map in addition to doing enhancement.  The enhancement algorithm uses full contextual information and adapts radial and angular extents based on block properties.  A new feature extraction algorithm based on chain code analysis is presented.  An objective metric is used to evaluate the efficiency of the feature extraction.

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

Motivation : Enhancement  Anisotropic filter (Greenberg et.al, Yang et.al)  Very fast but cannot handle creases, wide breaks and poor quality images  Pseudo Matched filtering (Wilson, Grother Candela et. al)  Increases SNR but can lead to artefacts due to isotropic filtering.  Directional Filtering (Sherlock,Monro et. al.)  Very robust even near regions of high curvature but marked by large storage requirements. Frequency of ridges is assumed to be constant.  Gabor filter bank(Hong et. al)  Filter has optimal joint directional and frequency resolution but does not handle high curvature regions well due to block wise approach. Angular and radial bandwidths are constant.  Proposed approach  A single algorithm is used for contextual analysis and enhancement.  Utilized full contextual information. Adapts both frequency and angular bandwidth based on block properties.  Adapts to high curvature regions reducing blocking artifacts.  However, using full contextual information leads to processing complexity.

Qualitative Comparison : Feature Extraction  MINDTCT,NIST NFIS, (Garris et. al)  The algorithm is extremely fast.  Greedy approach to minutia detection leads to false positives.Extensive post processing is required to eliminate false positives  Adaptive Flow Orientation technique (Ratha et. al.)  Is capable of correcting breaks in the rides and is robust to noise.  Peak detection leads to false positivies in regions of poor ridge constrast.Also, thinning and morphological post processing shift minutia location.  Direct Gray Scale Ridge Following (Maio and Maltoni)  Does not have errors introduced due to binarization and has low computational complexity.  Cannot handle poor contrast prints and images with poor ridge structure.  Proposed method  Enhancement reduces spurious and missing minutiae. The locations of the minutiae are preserved during detection.  Contour based extraction is sensitive to binarization and enhancement errors.

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image SNR is increased using Pseudo Matched filtering [Wilson et. Al, 1994], k = 0.15 is used to reduce artifacts

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Gray Level Image The image is divided into blocks and Fourier analysis is done on each of them. The analysis produces orientation, frequency, angular bandwidth and quality maps [proposed]

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image Each block is filtered using a orientation and frequency selective filter [Sherlock and Monro, 1994] with the given bandwidth

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image The enhanced image is binarized using an locally adaptive algorithm

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image Contours of the ridges are extracted and traced consistently in a counter clockwise direction[Govindaraju et. al, 2003]

Overview of the proposed method Fourier Analysis Contextual Filtering Preprocessing Binarization Contour ExtractionMinutiae Detection Enhancement Feature Extraction Gray Level Image Minutiae are detected as points with 'signficant' turns in the contour. Vector products are used to quanity the turns

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

Surface Wave Model Local ridge orientation Local ridge frequency

Validity of the model  With the exception of singularities such as core and delta, any local region of the fingerprint has consistent ridge orientation and frequency.  The ridge flow may be coarsely approximated using an oriented surface wave that can be identified using a single frequency f and orientation .  However, a real fingerprint is marked by a distribution of multiple frequencies and orientation.

Obtaining block parameters  To obtain the dominant ridge orientation and frequency a probabilistic approximation is used  We can represent the Fourier spectrum in polar form as F(r, ) The power spectrum is reduced to a joint probability density function using  The angular and frequency densities are given by marginal density functions,

Obtaining block parameters (contd.)  The dominant ridge orientation is obtained using  The dominant frequency can be estimated using the expected value of the frequency density function,  The quality is assumed to be proportional to the strength of the ridge flow and is estimated using

Fourier Analysis –Energy Map Original Image Energy Map

Original Image Local Ridge Frequency Map Fourier Analysis – Frequency Map

Original ImageLocal Ridge Orientation Map Fourier Analysis-Orientation Map

Fourier Analysis : Angular Bandwidth

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

Original Image Fourier Domain Based Enhancement Enhanced ImageContextual Filter

Additional Enhancement Results

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

 When the ridge contours are traced in a counter clockwise direction, minutiae are encountered as points with significant turn.  Types of turn points: left(ridge),right(bifurcation)  S(P in, P out ) = S( )=S(x 1 y 2 –x 2 y 1 )  P in : Vector leading into the candidate point  P out : Vector leading out of the point of interest  S(P in, P out ) >0 indicates left turn, S(P in, P out ) <0 indicates right turn  Significant turn can be determined by ( )=x 1 y 1 + x 2 y 2 < T Determination of Turn Points

Turn points (a) Potential minutia location; (b) Determination of turn points

Post processing Feature Extraction errors Missing minutiae Spurious minutiae Spurious minutia can be removed using post processing Heuristic rules: 1.Merge minutiae that are a certain distance of each other and have similar angles 2.Discard minutiae whose angles are inconsistent with ridge direction 3.Discard all border minutia 4.Discard opposing minutiae within certain distance of each other

Example Result

Outline  Related Previous Work  Overview of the proposed method  Fourier Analysis  Fingerprint Image Enhancement  Feature Extraction  Performance Evaluation  Conclusion

Quantitative Analysis  Test Data  150 prints from FVC2002(DB1) were randomly selected for evaluation.  Ground truth was established using a semi automated truthing tool.  Results compared using NIST NFIS open source software.  Metrics  We use feature extraction metrics proposed by Sherlock et. Al  Sensitivity: Ability of the algorithm to detect true minutiae  Specificity : Ability of the algorithm to avoid false positives  Additional Metrics  Flipped : Minutiae whose type has been exchanged

Quantitative Analysis : Results  Examples File NameNISTProposed method ActualTPFPMFTPFPMF 10_8.tif _6.tif _8.tif _6.tif _6.tif _7.tif _7.tif _6.tif _8.tif _7.tif

Quantitative Analysis : Results Summary results  Count TP(ANSI) > proposed : 40 of 150  Count E(ANSI) < proposed : 40 of 150 MetricNISTProposed Sensitivity(%) Specificity(%) Flipped(%) Sensitivity distribution Overall statistics

Conclusion  A new effective enhancement algorithm based on Fourier domain analysis is proposed  A single algorithm is used to derive orientation, frequency, angular bandwidth and quality maps  A new feature extraction algorithm based on chain code contour analysis is presented  Heuristic rules specific to the feature extraction algorithm has been derived  The algorithm is evaluated using an objective metric

Thank You

Related Previous Work: Enhancement  Spatial Domain  Anisotropic filter (Greenberg et.al, Yang et.al)  Uses a locally adaptive kernel  Blurs along the ridge direction. Increases the discrimination between ridges and valleys along the perpendicular direction.  Frequency Domain  Pseudo Matched filtering (Wilson, Grother Candela et. al)  The Fourier transform of the block is multiplied by its power spectrum raised to a power of k  Directional Filtering (Sherlock,Monro et. al.)  The image is decomposed into a set of eight directional responses using a bank of directionally selective filters. The frequency is assumed constant.  The enhanced image is obtained by composing the filter responses using the local orientations.  Gabor filter bank(Hong et. al)  The image is enhanced by using a Gabor filter bank  Gabor fillters have the optimum orientation and frequency resolution.

Related Previous Work: Feature Extraction  Binarized Images  MINDTCT, NIST NFIS, (Garris et. al)  An oriented grid is placed at each pixel and the projection sums are taken at each row. The pixel is assigned 0 if the projections sum at the center row is less than average, otherwise the pixel is assigned 1  The minutiae are detected using structural rules.  Adaptive Flow Orientation technique (Ratha et. al.)  Orientation of each 16x16 block is determined by computing the gray level projections at various angles. The projection along a scan line perpendicular the ridge direction has maximum variance.  The image is binarized by detecting the peaks along this scan line.  The minutiae are detected using the thinned image  Gray Scale Image  Direct Gray Scale Ridge Following (Maio and Maltoni)  A set of starting points are chosen by superimposing a grid on the image  The ridge is traced from each starting point until a bifurcation or ridge ending is found.  A labelling strategy is used to preven traversing the same ridge twice.