Learning Mahalanobis Distance for DTW based Online Signature Verification | |
Yu Qiao; Xingxing Wang; Chunjing Xu | |
2011 | |
会议名称 | 2011 International Conference on Information and Automation |
会议地点 | Shenzhen, China |
英文摘要 | Signature, a form of handwritten depiction, has been and is still widely used as a proof of the writer's identity/intent in human society. Online signaturesrepresents the dynamic process of handwriting as a sequence of feature vectors along time. Dynamic time warping (DTW) has been popularly adopted to compare sequence data. A basic problem in using DTW for signature verification is how to estimate the difference between the feature vectors. Most previous researches made use of Euclidean distance (ED) for this problem. However, ED treats each feature equally and cannot take account of the correlations between features. To overcome this problem, this paper proposed Mahalanobis distance (MD) for signature verification. One key question is how to estimate covariance matrix in MD calculation. We formulate this problem in a learning framework and introduce two criterion for estimating the matrix. The first criteria aims at minimizing the signature difference for the same writer, while the second criteria try to maximize the signature difference between different writers while minimize the within-writer signature difference. We carried out experiments on the MCYT biometric database. The experimental results exhibit that the proposed MD based method achieved better results than ED based method. |
收录类别 | EI |
语种 | 英语 |
内容类型 | 会议论文 |
源URL | [http://ir.siat.ac.cn:8080/handle/172644/3261] ![]() |
专题 | 深圳先进技术研究院_集成所 |
作者单位 | 2011 |
推荐引用方式 GB/T 7714 | Yu Qiao,Xingxing Wang,Chunjing Xu. Learning Mahalanobis Distance for DTW based Online Signature Verification[C]. 见:2011 International Conference on Information and Automation. Shenzhen, China. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论