Sciweavers

185 search results - page 12 / 37
» Latent Fingerprint Matching
Sort
View
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ICPR
2000
IEEE
15 years 10 months ago
A Minutia Matching Algorithm in Fingerprint Verification
Xiping Luo, Jie Tian, Yan Wu
COST
2009
Springer
121views Multimedia» more  COST 2009»
15 years 4 months ago
Vulnerability Assessment of Fingerprint Matching Based on Time Analysis
A time analysis of a reference minutiae-based fingerprint matching system is presented. We study the relation between the score generated by the system (NFIS2 from NIST) and the t...
Javier Galbally, Sara Carballo, Julian Fiér...
ICB
2007
Springer
161views Biometrics» more  ICB 2007»
15 years 1 months ago
Latent Identity Variables: Biometric Matching Without Explicit Identity Estimation
Abstract. We present a new approach to biometrics that makes probabilistic inferences about matching without ever estimating an identity "template". The biometric data is...
Simon J. D. Prince, Jania Aghajanian, Umar Mohamme...
ICPR
2010
IEEE
15 years 2 months ago
Fingerprint Pore Matching Based on Sparse Representation
—This paper proposes an improved direct fingerprint pore matching method. It measures the differences between pores by using the sparse representation technique. The coarse pore ...
Feng Liu, Qijun Zhao, Lei Zhang, David Zhang