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

A complete and scalable architecture for 3D model-based vision

Ruud Bolle, Andrea Califano, et al.

IEEE International Symposium on Intelligent Control 1990

Paper

Functional classification of proteins by pattern discovery and top-down clustering of primary sequences

A.H. Liu, Andrea Califano

IBM Systems Journal

Conference paper

Data and model driven foveation

Andrea Califano, Rick Kjeldsen, et al.

ICPR 1990

View all publications

Abstract

Related

FLASH: a fast look-up algorithm for string homology

A complete and scalable architecture for 3D model-based vision

Functional classification of proteins by pattern discovery and top-down clustering of primary sequences

Data and model driven foveation