Fingerprint matching using transformation parameter clustering

Robert S. Germain; Andrea Califano; Scott Colville

doi:10.1109/99.641608

IEEE computational science & engineering

Paper

01 Jan 1997

Fingerprint matching using transformation parameter clustering

View publication

Abstract

Fingerprint matching is used in many noncriminal identification applications. Flash, a similarity-searching algorithm akin to geometric hashing, proves suitable for one-to-many matching of fingerprints on large-scale databases.

Conference paper

FLASH: a fast look-up algorithm for string homology

Andrea Califano, I. Rigoutsos

CSCCVPR 1993

Conference paper

Multilevel evidence fusion for the recognition of three-dimensional objects. An overview of computer vision research at IBM T.J. Watson

Ruud Bolle, Andrea Califano, et al.

SPIE Advances in Intelligent Robotics Systems 1990

Conference paper

Systematic and automated discovery of patterns in PROSITE families

Reece Hart, A. Royyuru, et al.

RECOMB 2000

Conference paper

Evidence integration for 3D object recognition: A connectionist framework.

Rick Kjeldsen, Andrea Califano, et al.

CAIA 1989

View all publications

Abstract

Related

FLASH: a fast look-up algorithm for string homology

Multilevel evidence fusion for the recognition of three-dimensional objects. An overview of computer vision research at IBM T.J. Watson

Systematic and automated discovery of patterns in PROSITE families

Evidence integration for 3D object recognition: A connectionist framework.