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

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

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

Ruud Bolle, Andrea Califano, et al.

IEEE International Symposium on Intelligent Control 1990

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

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

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

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