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

被引:0
|
作者
Aini Najwa Azmi
Dewi Nasien
Fakhrul Syakirin Omar
机构
[1] Universiti Teknologi Malaysia,Department of Computer Science, Faculty of Computing
来源
关键词
Offline signature verification system; Preprocessing; Feature extraction; Freeman chain code; Euclidean distance;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:15341 / 15355
页数:14
相关论文
共 50 条
  • [21] A GENERALIZED K-NEAREST NEIGHBOR RULE
    PATRICK, EA
    FISCHER, FP
    INFORMATION AND CONTROL, 1970, 16 (02): : 128 - &
  • [22] Improved k-nearest neighbor classification
    Wu, YQ
    Ianakiev, K
    Govindaraju, V
    PATTERN RECOGNITION, 2002, 35 (10) : 2311 - 2318
  • [23] Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches
    Chavez, Edgar
    Sadit Tellez, Eric
    ADVANCES IN PATTERN RECOGNITION, 2010, 6256 : 270 - 280
  • [24] A Centroid k-Nearest Neighbor Method
    Zhang, Qingjiu
    Sun, Shiliang
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2010, PT I, 2010, 6440 : 278 - 285
  • [25] Smart Potato Disorders Diagnostic System Based on Fuzzy K-Nearest Neighbor
    Rayan, Zeina
    Samir, Sara
    Abdelfattah, Doaa
    Salem, Abdel-Badeeh M.
    5TH INTERNATIONAL CONFERENCE ON COMPUTING AND INFORMATICS (ICCI 2022), 2022, : 29 - 34
  • [26] Quantum K-nearest neighbor algorithm
    Chen, Hanwu
    Gao, Yue
    Zhang, Jun
    Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2015, 45 (04): : 647 - 651
  • [27] Validation of k-Nearest Neighbor Classifiers
    Bax, Eric
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) : 3225 - 3234
  • [28] Analysis of the k-nearest neighbor classification
    Li, Jing
    Cheng, Ming
    INFORMATION SCIENCE AND MANAGEMENT ENGINEERING, VOLS 1-3, 2014, 46 : 1911 - 1917
  • [29] Weighted K-Nearest Neighbor Revisited
    Bicego, M.
    Loog, M.
    2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 1642 - 1647
  • [30] A FUZZY K-NEAREST NEIGHBOR ALGORITHM
    KELLER, JM
    GRAY, MR
    GIVENS, JA
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (04): : 580 - 585