Fingerprint Matching
Three important topics are investigated by our team in fingerprint biometrics: privacy preservation by constructing cancelable fingerprint templates, indexing of the fingerprints and verification of the fingerprint matches.
Our cancelable fingerprint templates are constructed by hashing local minutia neighbourhoods by non-invertible symmetrical functions. The set of hashes for each neighbourhood contains less information than the original minutia set, but this information is sufficient to perform matching. In contrast to more widely investigated fingerprint vault algorithm, no pre-alignment is required for our algorithm.
Fingerprint indexing and verification of fingerprint match are two new projects, which we hope will be able to significantly reduce matching time and increase matching performance in fingerprint systems.