查看文章

Fingerprints have been used for a long time as a very adequate method of distinguishing people. Matching fingerprints can be very difficult without a good algorithm for the scanners. Complexities especially during the verification phase can arise from problems with the algorithm scanners use. In elections and other forms of voting, security and proof of individuality remain some of the biggest obstacles to be surmounted. This paper proposes an ideal algorithm which could solve these challenges. The Zhan-Suen Thinning Algorithm and the Guo-Hall Parallel Thinning Algorithm were compared using standard parameters from the perspective of fingerprint technology and electoral requirements to deduce the better algorithm. MATLAB® was used for the comparative performance analysis of the two algorithms. The time taken to complete iterations, quality of output produced and reliability were the parameters …