Fingerprint Identification using Bozorth and Boyer-Moore Algorithm

Abstract

The process of fingerprint identification in the form of a binary image can be performed with a variety of algorithms to matching the fingerprint process. This study aims to determine the time processing for fingerprint detection using Bozorth and Boyer-Moore models. The result showed that both of the models could detection the fingerprint. This paper contribution is to compare and analyze Bozorth and Boyer-Moore algorithms. The comparison is performed by MATLAB simulation. The simulation results Boyer-Moore algorithm has faster identification process. On the other hand, Bozort algorithm has an advantage for identification of effect rotated or space translated fingerprints.