2018 IEEE International Conference on Consumer Electronics (ICCE)

Secure and robust user authentication using partial

fingerprint matching

Geuntae Bae, Hojae Lee, Sunghoon Son, Doha Hwang, Jongseok Kim
Samsung Electronics, Korea
{geuntae.bae, hojae72.lee, s.h.son, doha.hwang, jx.kim}@samsung.com

Abstract—this paper proposes a robust fingerprint-based

authentication algorithm that ensures secure verification even
with limited-sized partial fingerprints. It has become increasingly
common that a number of recent consumer devices, such as
smartphones, employ fingerprint sensors for user authentication.
The sensors to be embedded are generally preferred to take up
less space for better usability and product design, the sensing
areas are therefore limited in size. To supplement the insufficient
area, devices often store multiple acquisitions from a single finger
in enrollment, later to verify at least any one of them successfully
match an acquisition in authentication. Considering the low
information entropy of a partial image, the security aspect of Figure 1 Partial Fingerprint Matching
small area-based systems is a major concern. On the other hand,
unpredictable variability due to finger rotation, grip positions, The biometric discrimination of the fingerprint images all
and skin deformation has a negative impact on biometric algorithms rely on is provided by the ‘feature’, which is
performance. This paper presents a fingerprint matcher or generally classified into three distinctive levels of detail [3].
verifier incorporating several efficient algorithms against these
• Level-1 features are the macro patterns of fingerprints,
concerns on both the performance and security aspects. A
method of "segmented area matching" brought an enhanced
such as singular points and global ridge patterns, e.g.
robustness to the variability, especially to finger rotation. And a deltas and cores. They are not very distinctive and thus
method of "feature-weighted block scoring" provided with more mainly used for fingerprint classification rather than
detailed image discrimination, resulting in improved security. verification.
Experimental evaluations with extensive database of partial
• Level-2 features primarily refer to the ‘minutiae’,
fingerprint images from more than 100 people, acquired by a
namely ridge endings and bifurcations. Level-2 features
small-sized capacitive sensor, demonstrated a significant
improvement over the previously suggested algorithms in both
are the most distinctive and stable features, which are
aspects. used in almost all automated fingerprint recognition
systems and can reliably be extracted from mid-
Keywords—biometrics, fingerprint matching, fingerprint resolution fingerprint images (approx. 500 dpi), which
verification, authentication, partial fingerprint, mobile security is also the standard fingerprint resolution for automatic
fingerprint recognition systems using minutiae [4].
I. INTRODUCTION
• Level-3 features are often defined as the dimensional
Fingerprint-based human identification, which had been attributes of the ridges and include sweat pores, ridge
addressed only in specialized technical fields such as forensics contours, and ridge edge features, all of which provide
and criminal investigations, has become one of the most widely quantitative data supporting more accurate and robust
used technology in everyday life, as increasingly adopted in fingerprint recognition.
popular consumer devices such as mobile phones recently.
After a long history of developing automated fingerprint The minutiae (level-2) matching is the most common
matching systems, recent technical concerns are primarily on method for the fingerprint verification or identification, and
providing users with faster and more convenient usability, various algorithms have been proposed to match two minutiae
combined with the latest device technology. templates of fingerprints [5] [6] [7]. However, in case of partial
image, poor quality, etc., sufficient minutiae may not be
The problem of fingerprint matching has been extensively acquired, thus may result in low matching accuracy. Moreover,
studied and numerous algorithms have been proposed [1] [2]. minutiae-based approaches may not fully utilize the rich
These algorithms are roughly classified into minutiae-based, discriminatory information available in the level-3 features of
ridge pattern-based, and image correlation-based approaches. fingerprints [9].

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.
978-1-5386-3025-9/18/$31.00 ©2018 IEEE
 The non-minutiae based approaches often utilize additional II. BACKGROUND AND RELATED WORK
characteristics from the fingerprint ridge pattern, such as local
orientation and frequency, ridge shape, and texture information A. Fingerprint Image Enhancement
containing higher discriminatory power [8]. Among them, the A variety of image enhancement methods has been
correlation-based approach superimposes two fingerprint proposed and being used, as the fingerprint pre-processing [1]
images and calculates the correlation between corresponding [2] [18] [19]. In this work, we used techniques such as
pixels in varied alignments, to estimate the similarity of the “Normalization” to stretch the contrast of an image, “ROI
two fingerprints [10] [11]. Segmentation” to locate the effective area of a fingerprint,
“Band-pass filter” to strengthen the ridge frequency signal, and
To accelerate the alignment or matching, some algorithms “Ridge-orientation filter” to boost up the signal in the ridge
use “Phase-only correlation (POC)” technique [12], and some direction.
use “Fourier-Mellin transform (FMT)” additionally for rotation
and scale matching [13] [14]. The POC has been successfully
applied to high-accuracy image registration problems in
computer vision application. The advantages of the POC are its
numerical efficiency, and robustness against noise by its high
resolution.
While most recent algorithms employ hybrid approach that
properly combine these various methods [15] [16] [17],
basically the correlation-based method is suitable for partial
fingerprints of good quality, by its high discriminatory
performance.
In designing a biometric verifier, performance factor such
as recognition rate, is obviously a top consideration since it is
directly related to usability [18] [19]. In addition, security
aspects such as defensiveness against explicit attacks should
also be considered. It is well known that in spite of its various
advantages, fingerprint-based biometric systems are potentially
vulnerable to a variety of attacks [20] [21] [22]. In particular,
poor information entropy of the partial fingerprint area should Figure 2 Fingerprint Enhancement
not be overlooked.
B. Minutiae Extraction
In sum, the problem description of this work is as follows:
Locating Minutiae points in the fingerprint image is also
• Mobile phones and other recent small form factor one of the well-researched subjects in fingerprint processing [5]
devices generally prefer acquiring only a partial portion [6] [7].
of the full fingerprint. Partial fingerprints possibly lack
For this work, processing such as “Ridge-direction filter”,
a sufficient number of feature patterns called ‘minutiae’,
“Binarization”, “Thinning (Zhang Suen)”, and “Elimination of
necessarily used by the most common method of the
false minutiae” [26] were used in a proper combination.
fingerprint matching.
• Good usability requires multiple enrollment of partial
fingerprints from a single finger to accommodate the
variation of finger impress position. In cases, a single
identity or person is allowed to enroll multiple fingers.
Hence, commonly a verifier declares accept if an input
fingerprint match at least any one of a large number of
the stored templates, thus it might eventually result in
security risks.
• For enhanced biometric performance and usability, fast
and precise processing even with the image variability
by finger rotation, position, deformation, etc. is critical.
The rest of the paper is organized as follows. In section 2,
we study the related work regarding the fingerprint image
processing algorithms. Section 3 first outlines a design goal of
the target system in security and performance aspects. Then,
we discuss details of the implemented algorithm and reasoning.
The result of experimental evaluations on our work is
presented in Section 4. Figure 3 Minutiae (feature) Extraction

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.
 C. FFT-based Image Registration ݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻ ൌ ݃ሺ‫ߠ •‘ ݔ‬଴ ൅ ‫ߠ ‹• ݕ‬଴ െ ܽǡ
Image Registration is also well-researched area in computer െ‫ߠ ‹• ݔ‬଴ ൅ ‫ߠ •‘ ݕ‬଴ െ ܾሻ
image processing [23][24][25]. Phase correlation provides According to the Fourier translation and rotation property,
estimation of rigid translational displacement between two transform of ݃ሺ‫ݔ‬ǡ ‫ݕ‬ሻ, ݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻ are now related by
images, which is based on the well-known Fourier shift
theorem: a shift in the spatial domain of two images results in a ‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ ൌ ‫ܩ‬ሺ‫ߠ •‘ ݑ‬଴ ൅ ‫ߠ ‹• ݒ‬଴ ǡ െ‫ߠ ‹• ݑ‬଴ ൅ ‫ߠ •‘ ݒ‬଴ ሻ
linear phase difference in the frequency domain by the Fourier ൈ ݁ ି௝ଶగሺ௔௨ା௕௩ሻ
Transform (FT).
The magnitudes of ‫ܩ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ and ‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ only represent a
Given two functions ݃ሺ‫ݔ‬ǡ ‫ݕ‬ሻ, ݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻ representing two 2D relative angle(ߠ଴ ሻ, excluding the translation, as follows.
images different only in a translational shift (ܽ in horizontal,
‫ܪ‬௠ ሺ‫ݑ‬ǡ ‫ݒ‬ሻ ൌ ‫ܩ‬௠ ሺ‫ߠ •‘ ݑ‬଴ ൅ ‫ߠ ‹• ݒ‬଴ ǡ െ‫ߠ ‹• ݑ‬଴ ൅ ‫ߠ •‘ ݒ‬଴ ሻ
and ܾ in vertical directions),
Then if we consider ‫ܩ‬௠ ሺ‫ݑ‬ǡ ‫ݒ‬ሻ and ‫ܪ‬௠ ሺ‫ݑ‬ǡ ‫ݒ‬ሻ in polar
݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻ ൌ ݃ሺ‫ ݔ‬െ ܽǡ ‫ ݕ‬െ ܾሻ
representation, ‫ܩ‬௠ ሺߠǡ ߩሻ ൌ ‫ܪ‬௠ ሺߠ െ ߠ଴ ǡ ߩሻ
The corresponding Fourier Transforms are denoted by
Much less computation is sufficient for the rotation
‫ܩ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ and ‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ.
matching that searches only the rotation angle without having
to consider the scale change. That is, since only Ʌ of the polar
‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ ൌ  ඵ ݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻ݁ ି௝ଶగሺ௫௨ା௬௩ሻ ݀‫ ݕ݀ݔ‬ሺ ሻ domainሺɅǡ ɏሻ is to be found through phase correlation, only 1-
dimensional iFT of Ȫ൫Ž‘‰ሺሻ൯ is required as follows.
ൌ  ඵ ݃ሺ‫ ݔ‬െ ܽǡ ‫ ݕ‬െ ܾሻ݁ ି௝ଶగሺ௫௨ା௬௩ሻ ݀‫ ݕ݀ݔ‬

ൌ  ඵ ݃ሺ‫ݔ‬Ԣǡ ‫ݕ‬Ԣሻ݁ ି௝ଶగ൛൫௫

ᇲ ା௔൯௨ା൫௬ ᇲ ା௕൯௩ൟ
݀‫ݔ‬Ԣ݀‫ݕ‬Ԣ ‫ݍ‬ሺߠǡ Ͳሻ ൌ ඵ ܳሺ‫ݑ‬ǡ ‫ݒ‬ሻ݁ ௝ଶగሺఏ௨ା଴௩ሻ ݀‫ݒ݀ݑ‬ሺ‹˜‡”•‡ ሻ 

ൌ ‫ܩ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ  ൈ ݁ ି௝ଶగሺ௔௨ା௕௩ሻ ൌ න ܳሺ‫ݑ‬ǡ Ͳሻ݁ ௝ଶగఏ௨ ݀‫ݑ‬ሺ„› ‘—”‹‡”‹–‡‰”ƒŽ‘˜‡” ‫ݒ‬ሻ

The phase correlation is defined as the normalized cross ൌ ߜሺߠ െ ߠ଴ ǡ Ͳሻ
power spectrum of G and H.
‫ܩ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ‫כ‬
ܳሺ‫ݑ‬ǡ ‫ݒ‬ሻ ൌ ൌ ݁ ௝ଶగሺ௔௨ା௕௩ሻ
ȁ‫ܩ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ‫ܪ‬ሺ‫ݑ‬ǡ ‫ݒ‬ሻ‫ כ‬ȁ
Then, the inverse Fourier Transform (iFT) of ܳሺ‫ݑ‬ǡ ‫ݒ‬ሻ is a
delta function. The function identifies the translational shift
ሺܽǡ ܾሻ that maximizes the cross-correlation between the pair of
images by the peak location, also representing the
correspondence strength by the peak magnitude.

‫ݍ‬ሺ‫ݔ‬ǡ ‫ݕ‬ሻ ൌ ඵ ܳሺ‫ݑ‬ǡ ‫ݒ‬ሻ݁ ௝ଶగሺ௫௨ା௬௩ሻ ݀‫ ݒ݀ݑ‬ሺ‹˜‡”•‡ ሻ

ൌ ߜሺ‫ ݔ‬൅ ܽǡ ‫ ݕ‬൅ ܾሻ

Figure 5 Rotation Alignment

Hence thanks to its efficiency, the rotation matching can be
used for candidate search that traverses entire templates.
III. PROPOSED METHODOLOGY
This section describes detailed algorithm or methodology
of this work, with several reasoning and principles.
Figure 4 Translation Alignment
In implementation, FT or iFT of a 2-dimensional image can A. Verification(Matching) algorithm
be computed quite quickly at the complexity of Ȫ൫ଶ Ž‘‰ሺሻ൯ 1) Candidate search: segment-based rotation matching
using the calculation-optimized one of discrete FTs, namely As a first step of a verification, segment-based rotation
“Fast Fourier Transform (FFT)”. matching is conducted against all enrolled templates.
And now, if two images are not only translated, but also As discussed in Section 2, a rotational correlation of two
rotated(ߠ଴ ) with each other, then polar-transformed Fourier magnitudes is performed in rotation

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.
 Figure 7 Verification Procedure (algorithm)
matching. Since the Fourier magnitude spectrum contains a lot images(64x64), the calculations can be further lowered in
of information about the image area, a strong correlation at a comparison with the whole image(128x128).
certain relative angle implies that the two image areas are
likely to be actually very similar. In addition, the band-limited POC can be used [12] [16].
Filtering by a POC peak threshold can be also used for
However, experimental observations have stated that the efficiency, since low peak magnitudes strongly imply low
rotational correlation for whole area cannot guarantee high similarities of the images in comparison.
accuracy, since the non-overlapping area act as noise. By
dividing an image into segments and searching the max value 3) Scoring (MS): Feature-weighted block scoring
of the phase correlation peaks for all segment combinations, As the last step, scoring or similarity evaluation is
the accuracy can be greatly improved. conducted. Basically, the similarity of two superimposed
images can be calculated by “Normalized Cross Correlation
(NCC)”, as follows. (0 < NCC < 1)
σ௫ǡ௬൫݃ሺ‫ ݔ‬െ ܽǡ ‫ ݕ‬െ ܾሻ ‫݄ ڄ‬ሺ‫ݔ‬ǡ ‫ݕ‬ሻ൯
ሺ„Ž‘ ሻ ൌ 
ඥσ௫ǡ௬ ݃ሺ‫ ݔ‬െ ܽǡ ‫ ݕ‬െ ܾሻଶ  ‫  ڄ‬σ௫ǡ௬ ݄ሺ‫ݔ‬ǡ ‫ݕ‬ሻଶ
Thus in a correlation-based method, the Match Score (MS)
can be quantified using the NCC, the size of the overlapped
area of two images, and so on.
For accuracy and efficiency, the similarity evaluation is
conducted per block based and cumulative-based, as follows.

Figure 6 Image Segmentation

Through sorting, the enroll fingerprints that record the peak
magnitude of the higher ranks are selected for the next step.
2) Matching (translation): segmented matching
The second step conducts translation matching between the
query image and the selected candidate enroll templates from
the first step. Before proceeding with matching, the selected
enroll image should be first rotated by the angle estimated at
the first step.
Since the calculation of translation (x, y) is a 2D iFFT
phase correlation, the computation amount is considerably
large. However, since it is also performed for the segment Figure 8 Verification Scoring (MS)

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.
 In addition, by numerous experimental observations on IV. EVALUATION
partial fingerprint images, we found out that minutiae areas are
much more discriminatory than other regions of an image. A. Experimental Environments
Thus it is reasonable to assign a greater weight to a minutiae Capacitive, 508 dpi,
block than to other blocks, in calculating scores. Fingerprint sensor Acquisition size : width:160p, height:70p
(physical effective area: 8.0 x 3.5mm)
100 persons (3 finger per person)
- 25 enroll images per finger
Fingerprint database
- 180 query images per finger
(data acquisitions)
(60 query images for 3 variant degree
acquisition)
Test platform (board) Samsung Exynos 8890

Implementation C++, android ndk build

B. Performance Evaluation
Verification tests were conducted on android platform with
database acquired by the capacitive fingerprint sensor for the
Thus, we have created an enhanced calculation method for latest mobile device. The database was obtained directly from
scoring that reflects this consideration. 100 volunteers and the number of test cases is considered
sufficient for the biometric evaluation.
- Total Num. of imposter verifications: 5,346,000 ([[[[)
- Total Num. of genuine verifications: 54,000 ([[[[)

Figure 9 an example of Feature Weighting

In this way, the last step incrementally measure the degree

of similarity by calculating the cumulative feature-weighted By applying the two schemes, we were able to achieve
score, and additionally can reduce execution time by applying significant performance improvements, False Rejection Rate of
the instant Accept and Reject policy. down to 1.63% (FRR @ FAR 1/50,000).
• Accept: If a sufficient MS above a threshold score (S) is Also, the verification time satisfied a targeted requirement
already achieved in the middle of processing, declares of 100ms, which is known to give enough usability to the user,
accept and returns. and the segmentation scheme achieved down to 43ms.
• Reject: If there is no score increase even after sufficient
matching trials above a threshold count (N), declares Average verification time
Scheme
reject and returns. Genuine Imposter Average

B. Template Structure Full image matching

22.42ms 123.78ms 73.10ms
(128x128 FFT)
As for partial fingerprint-based system, a template for a Segmented area matching
20.32ms 58.73ms 43.37ms
finger need to contain multiple fingerprints. For each (64x64 FFT)
fingerprint, image data and pre-computed phase data are stored.
C. Biometric Security
Template Capacity (limit) A commonly discussed subject in the literature on security
element Number Stored size (compacted) and vulnerability of fingerprint-based systems is the effects of
Per person 4 finger 2MB (1MB) the common minutiae pattern, so called “MasterPrint” [20] [21].
45 fingerprint(partial) But our verifier was very robust against the common minutiae
Per finger (25 enrolled at startup, and 507KB (253KB) pattern attack, since it's based on image correlation and even
up to 20 updated in verify) adopting the minutiae (feature) weighting scheme. However,
Image data (128x56) 7168byte (3584byte) the probability of imposter match (false accept) by the
Per fingerprint “common ridge patterns without minutiae” as follow was
(partial) Polar-transformed Fourier
4096byte (2048byte) relatively high, due to small size of the sensor.
magnitude phase data

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.
 [7] Jea, Tsai-Yang, and Venu Govindaraju. "A minutia-based partial
fingerprint recognition system." Pattern Recognition 38.10 (2005):
1672-1684.
[8] Yang, Jucheng. Non-minutiae based fingerprint descriptor. INTECH
Open Access Publisher, 2011.
[9] A. K. Jain, Y. Chen and M. Demirkus, "Pores and Ridges: High-
Resolution Fingerprint Matching Using Level 3 Features," in IEEE
Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no.
1, pp. 15-27, Jan. 2007.
[10] Karna, Deepak Kumar, Suneeta Agarwal, and Shankar Nikam.
"Normalized cross-correlation based fingerprint matching." Computer
Graphics, Imaging and Visualisation, 2008. CGIV'08. Fifth International
Conference on. IEEE, 2008.
[11] Cavusoglu, Abdullah, and Salih Gorgunoglu. "A robust correlation
based fingerprint matching algorithm for verification." Journal of
Applied Science 7 (2007): 3286-3291.
[12] Koichi, I. T. O., et al. "A fingerprint matching algorithm using phase-
only correlation." IEICE Transactions on Fundamentals of Electronics,
Communications and Computer Sciences 87.3 (2004): 682-691.
[13] J. Zhang, Z. Ou and H. Wei, "Fingerprint Matching Using Phase-Only
Correlation and Fourier-Mellin Transforms," Sixth International
Conference on Intelligent Systems Design and Applications, Jinan,
2006, pp. 379-383.
[14] Jin, Andrew Teoh Beng, David Ngo Chek Ling, and Ong Thian Song.
"An efficient fingerprint verification system using integrated wavelet
and Fourier–Mellin invariant transform." Image and Vision Computing
Evaluation with top 5% common pattern imposters 22.6 (2004): 503-513.
[15] Ross, Arun, Anil Jain, and James Reisman. "A hybrid fingerprint
The verification test by imposters gathered from the false matcher." Pattern Recognition 36.7 (2003): 1661-1673.
match score record of upper 5% which contain primarily
[16] Ito, Koichi, et al. "A fingerprint recognition algorithm combining phase-
common pattern and rarely include minutiae, has shown a little based image matching and feature-based matching." International
degraded result. But it remained at a reasonable level (3.1%), Conference on Biometrics. Springer Berlin Heidelberg, 2006.
thus proved to be considerably robust also in security aspect. [17] Nandakumar, Karthik, and Anil K. Jain. "Local Correlation-based
Fingerprint Matching." ICVGIP. 2004.
V. CONCLUSION [18] KHAN, Muhammad Ali., Fingerprint image enhancement and minutiae
In this work, we presented a novel partial fingerprint-based extraction. 2011.
verifier that ensures secure and robust user verification [19] Lin Hong, Yifei Wan and A. Jain, Fingerprint image enhancement:
algorithm and performance evaluation, in IEEE Transactions on Pattern
especially for mobile environment and small-sized sensors. Analysis and Machine Intelligence, vol. 20, no. 8, pp. 777-789, Aug
The method of "segmented area matching" strongly 1998.
enhanced robustness to the query variability, especially to [20] Roy, Aditi, Nasir Memon, and Arun Ross. "MasterPrint: Exploring the
Vulnerability of Partial Fingerprint-based Authentication Systems."
finger rotation. And the method of "feature-weighted block IEEE Transactions on Information Forensics and Security (2017).
correlation scoring" provided much more detailed image
[21] Jea, Tsai-Yang, et al. "Security and matching of partial fingerprint
discrimination, resulting in improved security. Experimental recognition systems." Defense and Security. International Society for
evaluations with extensive database of partial fingerprint Optics and Photonics, 2004.
images from more than 100 people, acquired by a small-sized [22] U. Uludag and A. K. Jain. Attacks on biometric systems: a case study in
capacitive sensor, demonstrated a significant improvement fingerprints. In SPIE Electronic Imaging, pages 622–633. Intl Society
over the traditional correlation-based methods. for Optics and Photonics, 2004.
[23] Zitova, Barbara, and Jan Flusser. "Image registration methods: a
REFERENCES survey." Image and vision computing 21.11 (2003): 977-1000.
[1] Maltoni, Davide, et al. Handbook of fingerprint recognition. Springer [24] Reddy, B. Srinivasa, and Biswanath N. Chatterji. "An FFT-based
Science & Business Media, 2009. technique for translation, rotation, and scale-invariant image
registration." IEEE transactions on image processing 5.8 (1996): 1266-
[2] Ratha, Nalini, and Ruud Bolle, eds. Automatic fingerprint recognition 1271.
systems. Springer Science & Business Media, 2007.
[25] Tzimiropoulos, Georgios, et al. "Robust FFT-based scale-invariant
[3] Zhang, David, et al. "Selecting a reference high resolution for fingerprint image registration with image gradients." IEEE transactions on pattern
recognition using minutiae and pores." IEEE Transactions on analysis and machine intelligence 32.10 (2010): 1899-1906.
Instrumentation and Measurement 60.3 (2011): 863-871.
[26] Kim, Seonjoo, Dongjae Lee, and Jaihie Kim. "Algorithm for detection
[4] Jain, Anil K., Yi Chen, and Meltem Demirkus. "Pores and ridges: High- and elimination of false minutiae in fingerprint images." International
resolution fingerprint matching using level 3 features." IEEE Conference on Audio-and Video-Based Biometric Person
Transactions on Pattern Analysis and Machine Intelligence 29.1 (2007). Authentication. Springer Berlin Heidelberg, 2001.
[5] Zaeri, Naser. "Minutiae-based fingerprint extraction and recognition", [27] Mathur, Surbhi, et al. "Methodology for partial fingerprint enrollment
INTECH Open Access Publisher, 2011. and authentication on mobile devices." Biometrics (ICB), 2016
[6] Xiping Luo, Jie Tian and Yan Wu, "A minutiae matching algorithm in International Conference on. IEEE, 2016.
fingerprint verification," Proceedings 15th International Conference on
Pattern Recognition. ICPR-2000, Barcelona, 2000, pp. 833-836 vol.4.

Authorized licensed use limited to: Indian Institute of Information Technology Kottayam. Downloaded on February 04,2025 at 12:39:54 UTC from IEEE Xplore. Restrictions apply.