Minutiae-based fingerprint matching algorithms generally consist of two steps: alignment of minutiae and search for the corresponding minutiae. This paper presents a triangular matching algorithm for fast alignment, in which the overall processing time can be significantly cut down by making a quick decision on the amounts of rotation and translation between a pair of fingerprint images. The alignment algorithm proposes a novel triangular data structure and utilizes Parzen density estimation. The proposed algorithm has been tested under well-formed testing scenario over an Atmel fingerprint database and demonstrated promising improvement both in processing time and in recognition accuracy.
展开▼
