Automatic Fingerprint Recognition Systems
DOI: 10.1007/0-387-21685-5_6
|View full text |Cite
|
Sign up to set email alerts
|

Image Filter Design for Fingerprint Enhancement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…For a given N dimension the traditional discrete Fourier transform [15] is a linear operator on C N mapping ( x 0 , x 1 ,…, x N −1 ) to ( y 0 , y 1 ,…, y N −1 ), where yk=1Nfalse∑i=normal0Nnormal1xje2πikj/N(k=0,1,,N1).   The quantum Fourier transform (QFT) algorithm can be obtained from the traditional discrete Fourier transform [16] which is QFT:UQFT|x=1normal2mfalse∑i=normal0normal2mnormal1e2πitx/2m|t. QFT can be used in novel image encryption and decryption [17], where the quantum bit numbers of the quantum state | x 〉 are m , U QFT is a unitary operator, and QFT is a 2 m -dimensional unitary transformation [18, 19]. The effect of (11) is to transform a unit quantum state into a superposition state.…”
Section: Palmprint Feature Extraction Based On Quantum Fourier Tramentioning
confidence: 99%
“…For a given N dimension the traditional discrete Fourier transform [15] is a linear operator on C N mapping ( x 0 , x 1 ,…, x N −1 ) to ( y 0 , y 1 ,…, y N −1 ), where yk=1Nfalse∑i=normal0Nnormal1xje2πikj/N(k=0,1,,N1).   The quantum Fourier transform (QFT) algorithm can be obtained from the traditional discrete Fourier transform [16] which is QFT:UQFT|x=1normal2mfalse∑i=normal0normal2mnormal1e2πitx/2m|t. QFT can be used in novel image encryption and decryption [17], where the quantum bit numbers of the quantum state | x 〉 are m , U QFT is a unitary operator, and QFT is a 2 m -dimensional unitary transformation [18, 19]. The effect of (11) is to transform a unit quantum state into a superposition state.…”
Section: Palmprint Feature Extraction Based On Quantum Fourier Tramentioning
confidence: 99%
“…They have higher computational complexity. In the frequency domain [6] computed the optimal orientation using directional filters, taking into account the highest filter response and local smoothing. Short Time Fourier Transform (STFT) analysis was introduced by [7].…”
Section: Introductionmentioning
confidence: 99%