A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph

A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph

The main aim of this paper is to describe an inter-minutiae binary network-based global matching algorithm. It exploits absolute minutiae features represented by a binary constraint graph. A dynamic tolerance area in the neighborhood of the minutiae combined with the search-rearrangement method on t...

Full description

Bibliographic Details
Main Authors: K. Bey Beghdad, H. Hentous, F. Benhammadi
Format: Article
Language:English
Published: SpringerOpen 2008-03-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://dx.doi.org/10.1155/2008/479106
id doaj-f28d10e6eaba4bf585fdb0514717ec9c
record_format Article
spelling doaj-f28d10e6eaba4bf585fdb0514717ec9c2020-11-25T00:08:03ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61722008-03-01200810.1155/2008/479106A Fingerprint Recognizer Using Interminutiae Binary Constraint GraphK. Bey BeghdadH. HentousF. BenhammadiThe main aim of this paper is to describe an inter-minutiae binary network-based global matching algorithm. It exploits absolute minutiae features represented by a binary constraint graph. A dynamic tolerance area in the neighborhood of the minutiae combined with the search-rearrangement method on the binary constraint graph is used to perform the global matching. Tests on the public fingerprint databases DB1 and DB2 FVC2002 showed that our approach outperforms those based on the forward tracking search only. The most relevant aspect of this algorithm is that it does not require implicit alignment of the two fingerprint images due to the strong dependencies between minutiae described by the constraint graph.http://dx.doi.org/10.1155/2008/479106
collection DOAJ
language English
format Article
sources DOAJ
author K. Bey Beghdad
H. Hentous
F. Benhammadi
spellingShingle K. Bey Beghdad
H. Hentous
F. Benhammadi
A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
EURASIP Journal on Advances in Signal Processing
author_facet K. Bey Beghdad
H. Hentous
F. Benhammadi
author_sort K. Bey Beghdad
title A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
title_short A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
title_full A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
title_fullStr A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
title_full_unstemmed A Fingerprint Recognizer Using Interminutiae Binary Constraint Graph
title_sort fingerprint recognizer using interminutiae binary constraint graph
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6172
publishDate 2008-03-01
description The main aim of this paper is to describe an inter-minutiae binary network-based global matching algorithm. It exploits absolute minutiae features represented by a binary constraint graph. A dynamic tolerance area in the neighborhood of the minutiae combined with the search-rearrangement method on the binary constraint graph is used to perform the global matching. Tests on the public fingerprint databases DB1 and DB2 FVC2002 showed that our approach outperforms those based on the forward tracking search only. The most relevant aspect of this algorithm is that it does not require implicit alignment of the two fingerprint images due to the strong dependencies between minutiae described by the constraint graph.
url http://dx.doi.org/10.1155/2008/479106
work_keys_str_mv AT kbeybeghdad afingerprintrecognizerusinginterminutiaebinaryconstraintgraph
AT hhentous afingerprintrecognizerusinginterminutiaebinaryconstraintgraph
AT fbenhammadi afingerprintrecognizerusinginterminutiaebinaryconstraintgraph
AT kbeybeghdad fingerprintrecognizerusinginterminutiaebinaryconstraintgraph
AT hhentous fingerprintrecognizerusinginterminutiaebinaryconstraintgraph
AT fbenhammadi fingerprintrecognizerusinginterminutiaebinaryconstraintgraph
_version_ 1725417041387585536

Similar Items