An Efficient Approach for Recognition and Verification of On-Line Signatures Using PSO

S. Dutta, Rajkumar Saini, Pradeep Kumar, P. Roy
{"title":"An Efficient Approach for Recognition and Verification of On-Line Signatures Using PSO","authors":"S. Dutta, Rajkumar Saini, Pradeep Kumar, P. Roy","doi":"10.1109/ACPR.2017.115","DOIUrl":null,"url":null,"abstract":"Signature recognition and verification have been widely used for user authentication. A person is allowed to proceed further only when his/her signature matches with his/her model or template(s) stored in the database. In this paper, a robust approach for online signature recognition and verification has been proposed. Signatures have been segmented into uniform segments and features are collected from each segment to capture local dynamic properties. For signature recognition task, Random Forest is used as the classifier and particle swarm optimization(PSO) has been used to select the best feature-set and model parameter. The feature set and parameters selected from recognition task have been used in training binary random forest classifiers for user verification. Signature verification has been performed in two modes i.e. using global threshold and local threshold and corresponding results have been reported. In our experiment, we have used two public datasets (MCYT-100 and SVC-2004) and have achieved over 99% recognition rate and encouraging Equal Error Rate (EER) for verification on both the datasets.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2017.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Signature recognition and verification have been widely used for user authentication. A person is allowed to proceed further only when his/her signature matches with his/her model or template(s) stored in the database. In this paper, a robust approach for online signature recognition and verification has been proposed. Signatures have been segmented into uniform segments and features are collected from each segment to capture local dynamic properties. For signature recognition task, Random Forest is used as the classifier and particle swarm optimization(PSO) has been used to select the best feature-set and model parameter. The feature set and parameters selected from recognition task have been used in training binary random forest classifiers for user verification. Signature verification has been performed in two modes i.e. using global threshold and local threshold and corresponding results have been reported. In our experiment, we have used two public datasets (MCYT-100 and SVC-2004) and have achieved over 99% recognition rate and encouraging Equal Error Rate (EER) for verification on both the datasets.
基于粒子群算法的在线签名识别与验证方法
签名识别与验证在用户认证中得到了广泛的应用。任何人士只有在其签名与资料库内所存的模型或模板相符时,才可继续办理有关手续。本文提出了一种鲁棒的在线签名识别与验证方法。签名被分割成统一的段,并从每个段中收集特征,以捕捉局部的动态特性。对于签名识别任务,使用随机森林作为分类器,并使用粒子群优化(PSO)来选择最佳特征集和模型参数。从识别任务中选择的特征集和参数被用于训练二元随机森林分类器以供用户验证。采用全局阈值和局部阈值两种方式进行了签名验证,并报告了验证结果。在我们的实验中,我们使用了两个公共数据集(MCYT-100和SVC-2004),并在两个数据集上实现了99%以上的识别率和鼓励的等错误率(EER)进行验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信