4.6 Article

Online handwritten signature verification using feature weighting algorithm relief

期刊

SOFT COMPUTING
卷 22, 期 23, 页码 7811-7823

出版社

SPRINGER
DOI: 10.1007/s00500-018-3477-2

关键词

Signature verification; Online signature; Combined feature; Relief algorithm; Feature selection

资金

  1. National Natural Science Foundation of China [61671360, 61672415]
  2. Key Program of NSFC-Tongyong Union Foundation [U1636209]
  3. National Key Basic Research Program [2017YFB0801805]
  4. Key Program of NSFC [U1405255]
  5. Natural Science Basic Research Plan in Shaanxi Province of China [2017JM6082]
  6. opening project of Science and Technology on Communication Networks Laboratory [KX172600024]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据