{"title":"Countermatch: A Neural Network Approach to Automatic Signature Verification","authors":"G. Hesketh","doi":"10.1049/IC:19970100","DOIUrl":null,"url":null,"abstract":"The COUNTERMATCH algorithm is an elastic matching neural network model which attempts to link all the corresponding points between two dynamic signatures; a signature is simply an ordered set of strokes, each stroke being an ordered list of inking pen positions derived from fixed period sampling on a graphics tablet. Once a point-for-point correspondence has been defined, the algorithm can assign a numerical dissimilarity between the two signatures on the basis of the amount of elastic deformation required to change one into the other. A simple (or complex) discriminant can then be constructed from a training set of dissimilarities derived from known authentic and forgery matches.","PeriodicalId":235767,"journal":{"name":"SNN Symposium on Neural Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SNN Symposium on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IC:19970100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The COUNTERMATCH algorithm is an elastic matching neural network model which attempts to link all the corresponding points between two dynamic signatures; a signature is simply an ordered set of strokes, each stroke being an ordered list of inking pen positions derived from fixed period sampling on a graphics tablet. Once a point-for-point correspondence has been defined, the algorithm can assign a numerical dissimilarity between the two signatures on the basis of the amount of elastic deformation required to change one into the other. A simple (or complex) discriminant can then be constructed from a training set of dissimilarities derived from known authentic and forgery matches.