TY - GEN
T1 - Robust fingerprint matching using spiral partitioning scheme
AU - Shi, Zhixin
AU - Govindaraju, Venu
PY - 2009
Y1 - 2009
N2 - Fingerprint matching for low quality or partial fingerprint images is very challenging. It is mainly because the features such as minutia points can not be extracted reliably. In the case of partial fingerprint images captured using solid state sensors, enough number of minutia points may not be included. In this paper, we introduce a novel fingerprint representation that combines information from each extracted minutia with detected ridges in its neighborhood. The proposed algorithm first enhances a fingerprint image and generates a binary image. Then instead of using thinning-based algorithms, the ridges are extracted using a chaincode scheme, which retains the original thickness of the ridges and precise local orientations. The minutia points are detected by tracing the ridge lines. Finally the enriched local structural features are built for each minutia by a spiral coding using the ridge line orientations around the minutia. The new features are translation and rotational invariant. Each feature vector represents a minutia and its neighboring ridge structures. Matching of two fingerprints is performed by calculating the Euclidean distances between pairs of corresponding feature vectors. Preliminary experiments show that the proposed algorithm is effective.
AB - Fingerprint matching for low quality or partial fingerprint images is very challenging. It is mainly because the features such as minutia points can not be extracted reliably. In the case of partial fingerprint images captured using solid state sensors, enough number of minutia points may not be included. In this paper, we introduce a novel fingerprint representation that combines information from each extracted minutia with detected ridges in its neighborhood. The proposed algorithm first enhances a fingerprint image and generates a binary image. Then instead of using thinning-based algorithms, the ridges are extracted using a chaincode scheme, which retains the original thickness of the ridges and precise local orientations. The minutia points are detected by tracing the ridge lines. Finally the enriched local structural features are built for each minutia by a spiral coding using the ridge line orientations around the minutia. The new features are translation and rotational invariant. Each feature vector represents a minutia and its neighboring ridge structures. Matching of two fingerprints is performed by calculating the Euclidean distances between pairs of corresponding feature vectors. Preliminary experiments show that the proposed algorithm is effective.
UR - https://www.scopus.com/pages/publications/69949169289
U2 - 10.1007/978-3-642-01793-3_66
DO - 10.1007/978-3-642-01793-3_66
M3 - Conference contribution
AN - SCOPUS:69949169289
SN - 3642017924
SN - 9783642017926
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 647
EP - 655
BT - Advances in Biometrics - Third International Conference, ICB 2009, Proceedings
T2 - 3rd International Conference on Advances in Biometrics, ICB 2009
Y2 - 2 June 2009 through 5 June 2009
ER -