proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details

in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean

distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a

verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms

published in the open literature-proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details　

　in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean　

　distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a　

　verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms　

　published in the open literature