1996
DOI: 10.1016/0031-3203(96)00018-0
|View full text |Cite
|
Sign up to set email alerts
|

Fingerprint classification using a hexagonal fast fourier transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0
1

Year Published

2001
2001
2021
2021

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 83 publications
(33 citation statements)
references
References 4 publications
0
29
0
1
Order By: Relevance
“…This is even true for human finger prints (Prabhakar, 2001) although various classification paradigms of false acceptance or false rejection, examined the distinguishing nature of the physical characteristics. The prediction accuracies achieved for human finger prints typically lie between 85% (Fitz and Green, 1996) and 96.5% (Chong et al, 1997), using different data bases (such as singular points, orientation field, ridge lines) and paradigms (such as rules, supervised learning, discrete class assignments based on knowledge-based features; see Prabhakar, 2001). …”
Section: Discussionmentioning
confidence: 99%
“…This is even true for human finger prints (Prabhakar, 2001) although various classification paradigms of false acceptance or false rejection, examined the distinguishing nature of the physical characteristics. The prediction accuracies achieved for human finger prints typically lie between 85% (Fitz and Green, 1996) and 96.5% (Chong et al, 1997), using different data bases (such as singular points, orientation field, ridge lines) and paradigms (such as rules, supervised learning, discrete class assignments based on knowledge-based features; see Prabhakar, 2001). …”
Section: Discussionmentioning
confidence: 99%
“…Edge based methodologies customarily utilize the data of the structure recurrence of the unique finger impression edges for arrangement purposes. [15] Considers the recurrence range of fingerprints, A wedge-ring indicator is utilized to parcel the recurrence area pictures into noncovering zones in which the pixel qualities are summed up to structure a feature vector. When the peculiarity vector is discovered, it is contrasted with the reference characteristic vectors of each of the classes and a further order is performed by utilizing a closest neighbor arrangement system.…”
Section: IVmentioning
confidence: 99%
“…We look for a shear operating along the first vector of this lattice, thus with matrix where has the form (15) At the end, the lattice has matrix , or, equivalently (16) The last factorization (16) provides the geometric interpretation of the decomposition, using shears along 1-D directions of the supporting lattices. On the other hand, the factorization (11), when read from the left to the right, provides the practical way for implementing the conversion between the two lattices, as detailed in the next section, since the operations are directly expressed in the basis of the pixel indices.…”
Section: A Mathematical Principlementioning
confidence: 99%