Online handwritten signature verification using feature weighting algorithm relief

被引:22
作者
Yang, Li [1 ]
Cheng, Yuting [1 ]
Wang, Xianmin [2 ]
Liu, Qiang [3 ]
机构
[1] Xidian Univ, Sch Comp Sci & Technol, Xian 710071, Shaanxi, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Sci & Technol Commun Networks Lab, Shijiazhuang 050081, Hebei, Peoples R China
基金
中国国家自然科学基金;
关键词
Signature verification; Online signature; Combined feature; Relief algorithm; Feature selection; FEATURE-EXTRACTION; REPRESENTATION; CLASSIFIER;
D O I
10.1007/s00500-018-3477-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Online handwritten signatures are widely used as a reliable identity authentication technology in industries such as banking, insurance and hospitals. Most existing online handwritten signature verification schemes usually choose the same feature sets for different users while comparing different signatures, which may reduce the stability of the dynamic characteristics. To avoid this problem, we propose a novel writer-dependent online signature verification technique based on Relief. For each user, our verification scheme falls into two phases: the training phase and the test phase. In the training phase, we select a signature as the base signature from real signatures and construct two different kinds of signature pairs: the real signature pairs and the forged signature pairs. Each pair of real signatures consists of two real signatures, and each pair of forgeries is made up of a real signature and a forgery. A group of combined features are defined for each pair of signatures. Then, we select more stable combined features by means of the Relief algorithm and compute a matrix used as a matching template, which contains the value of each combined feature for each pair of signatures. In the test phase, the classification of the pair of signatures composed of the test signature and the base reference signature is determined by the K-nearest neighbor. Experiments are conducted on our own database and SVC2004, and the results indicate that the method we propose here shows lower FAR and FRR than do traditional methods on the same databases.
引用
收藏
页码:7811 / 7823
页数:13
相关论文
共 44 条
[1]  
[Anonymous], IEEE COMPUTER SOC
[2]  
[Anonymous], ARXIV150903755
[3]  
[Anonymous], 2017, IMAGE PROCESSING THE, DOI [10.1109/IPTA.2017.8310112, DOI 10.1109/IPTA.2017.8310112, 10.1109/IPTA. 2017.8310112]
[4]  
[Anonymous], 2013, ELECTROMAGN BIOL MED, DOI DOI 10.12792/ICISIP2013.020
[5]  
[Anonymous], SECURITY COMMUNICATI
[6]  
Aqili N, 2016, 2016 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT), P410, DOI 10.1109/EITech.2016.7519631
[7]   Online Signature Verification Based on Generative Models [J].
Argones Rua, Enrique ;
Alba Castro, Jose Luis .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2012, 42 (04) :1231-1242
[8]   Coverless Information Hiding Based on the Molecular Structure Images of Material [J].
Cao, Yi ;
Zhou, Zhili ;
Sun, Xingming ;
Gao, Chongzhi .
CMC-COMPUTERS MATERIALS & CONTINUA, 2018, 54 (02) :197-207
[9]   Verifiable Computation over Large Database with Incremental Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Weng, Jian ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (10) :3184-3195
[10]   New method for the on-line signature verification based on horizontal partitioning [J].
Cpalka, Krzysztof ;
Zalasinski, Marcin ;
Rutkowski, Leszek .
PATTERN RECOGNITION, 2014, 47 (08) :2652-2661