Sciweavers

150 search results - page 8 / 30
» Fingerprint matching by genetic algorithms
Sort
View
AAAI
1998
15 years 1 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
J. Ross Beveridge
ISAAC
1994
Springer
91views Algorithms» more  ISAAC 1994»
15 years 3 months ago
A New Problem in String Searching
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
George Havas, Jin Xian Lian
ICIAP
2005
ACM
15 years 12 months ago
Combining Multiple Matchers for Fingerprint Verification: A Case Study in FVC2004
Abstract. Combining different algorithms submitted to the Third International Fingerprint Verification Competition (FVC2004) is studied. For this work, the matching results of more...
Julian Fiérrez-Aguilar, Loris Nanni, Javier...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 2 days 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
2010
IEEE
15 years 4 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