Biometric signature verification system based on freeman chain code and k-nearest neighbor

• Main Authors: Azmi, A. N., Nasien, D., Omar, F. S.
• Format: Article
• Language: English
• Published: Springer New York LLC 2017
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/74867/1/AiniNajwaAzmi2017_BiometricSignatureVerificationSystembasedonFreeman.pdf; http://eprints.utm.my/id/eprint/74867/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84988429321&doi=10.1007%2fs11042-016-3831-2&partnerID=40&md5=2f4a3d4dfd4e1af4e657f7911e62126b

Signature is one of human biometrics that may change due to some factors, for example age, mood and environment, which means two signatures from a person cannot perfectly matching each other. A Signature Verification System (SVS) is a solution for such situation. The system can be decomposed into three stages: data acquisition and preprocessing, feature extraction and verification. This paper presents techniques for SVS that uses Freeman chain code (FCC) as data representation. Before extracting the features, the raw images will undergo preprocessing stage; binarization, noise removal, cropping and thinning. In the first part of feature extraction stage, the FCC was extracted by using boundary-based style on the largest contiguous part of the signature images. The extracted FCC was divided into four, eight or sixteen equal parts. In the second part of feature extraction, six global features were calculated against split image to test the feature efficiency. Finally, verification utilized Euclidean distance to measured and matched in k-Nearest Neighbors. MCYT bimodal database was used in every stage in the system. Based on the experimental results, the lowest error rate for FRR and FAR were 6.67 % and 12.44 % with AER 9.85 % which is better in term of performance compared to other works using that same database.