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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.