Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Xu, Haiyun and Veldhuis, R.N.J. and Kevenaar, T.A.M. and Akkermans, A.H.M. and Bazen, A.M.
(2008)
Spectral minutiae: A fixed-length representation of a minutiae set.
In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Workshop on Biometrics, 24-28 Jun 2008, Anchorage, Alaska, US.
pp. 1-6.
IEEE Computer Society.
ISBN 978-1-4244-2340-8
Full text available as:
Official URL: http://dx.doi.org/10.1109/CVPRW.2008.4563120  AbstractMinutiae, which are the endpoints and bifurcations of fingerprint ridges, allow a very discriminative classification of fingerprints. However, a minutiae set is an unordered set and the minutiae locations suffer from various deformations such as translation, rotation and scaling. In this paper, we introduce a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. By applying the spectral minutiae representation, we can combine the fingerprint recognition system with a template protection scheme, which requires a fixed-length feature vector. This paper also presents two spectral minutiae matching algorithms and shows experimental results.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
