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

Systematic and automated discovery of patterns in PROSITE families

Conference paper

FLASH: a fast look-up algorithm for string homology

Conference paper

Data and model driven foveation

Conference paper

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

View all publications

Abstract

Related

Systematic and automated discovery of patterns in PROSITE families

FLASH: a fast look-up algorithm for string homology

Data and model driven foveation

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