A minimum-velocity-based segmentation scheme for improved performance of an online signature verification system

T. A. Osman, M. Krishnan, M. Paulik
{"title":"A minimum-velocity-based segmentation scheme for improved performance of an online signature verification system","authors":"T. A. Osman, M. Krishnan, M. Paulik","doi":"10.1109/EIT.2008.4554271","DOIUrl":null,"url":null,"abstract":"In this work, a novel segmentation scheme for online handwritten signatures is presented in order to extract local characteristics that are consistent among the different signature samples. In the new segmentation scheme, the segmentation points of the reference/master signature are allocated at the minimum velocity points or ldquovalleysrdquo. To avoid an excessive number of segmentation points, a constraint factor of minimum segment size is applied while extracting the valleys. Then, the correspondent segmentation points in each of the test or other enrollment signatures are allocated by finding the minimum velocity points occurring within a window of points centered at each segment-boundary-point of the master signature. The paper also presents an algorithm to select the master/reference signature sample among the enrollment signature samples for each writer. According to the selection criteria, the master/reference signature is the signature that contains the most repeated valleys locations. The evaluation of the new segmentation method showed significant improvement over a benchmark method, developed in earlier work, whose segmentation was based on the dynamic time warping technique.","PeriodicalId":215400,"journal":{"name":"2008 IEEE International Conference on Electro/Information Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Electro/Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2008.4554271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, a novel segmentation scheme for online handwritten signatures is presented in order to extract local characteristics that are consistent among the different signature samples. In the new segmentation scheme, the segmentation points of the reference/master signature are allocated at the minimum velocity points or ldquovalleysrdquo. To avoid an excessive number of segmentation points, a constraint factor of minimum segment size is applied while extracting the valleys. Then, the correspondent segmentation points in each of the test or other enrollment signatures are allocated by finding the minimum velocity points occurring within a window of points centered at each segment-boundary-point of the master signature. The paper also presents an algorithm to select the master/reference signature sample among the enrollment signature samples for each writer. According to the selection criteria, the master/reference signature is the signature that contains the most repeated valleys locations. The evaluation of the new segmentation method showed significant improvement over a benchmark method, developed in earlier work, whose segmentation was based on the dynamic time warping technique.
一种提高在线签名验证系统性能的基于最小速度的分割方案
在这项工作中,提出了一种新的在线手写签名分割方案,以提取不同签名样本之间一致的局部特征。在新的分割方案中,参考/主签名的分割点被分配在最小速度点或ldquovalleyysrdquo上。为避免分割点过多,在提取谷值时,采用最小分割尺寸约束因子。然后,通过找到以主签名的每个段边界点为中心的点的窗口内出现的最小速度点来分配每个测试或其他注册签名中的相应分割点。本文还提出了一种从每位作者的注册签名样本中选择主/参考签名样本的算法。根据选择标准,主/参考签名是包含重复山谷位置最多的签名。对新分割方法的评估表明,与早期基于动态时间规整技术的基准分割方法相比,该方法有了显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信