{"title":"Fingerprint image matching by minimization of a thin-plate energy using a two-step algorithm with auxiliary variables","authors":"Andrés Almansa, L. Cohen","doi":"10.1109/WACV.2000.895400","DOIUrl":null,"url":null,"abstract":"A common approach in fingerprint matching algorithms consists of minimizing a similarity measure between feature vectors of both images, over a set of linear transformations of one image to the other. In this work we propose the thin-plate spline as a more accurate model for the geometric transformations that arise in fingerprint images. In addition we show how such a model can be integrated into a matching algorithm by means of a two-step iterative minimization with auxiliary variables. Such a method allows to correct many of the false pairings of minutiae commonly found by matching algorithms based on linear transforms.","PeriodicalId":306720,"journal":{"name":"Proceedings Fifth IEEE Workshop on Applications of Computer Vision","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fifth IEEE Workshop on Applications of Computer Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WACV.2000.895400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55
Abstract
A common approach in fingerprint matching algorithms consists of minimizing a similarity measure between feature vectors of both images, over a set of linear transformations of one image to the other. In this work we propose the thin-plate spline as a more accurate model for the geometric transformations that arise in fingerprint images. In addition we show how such a model can be integrated into a matching algorithm by means of a two-step iterative minimization with auxiliary variables. Such a method allows to correct many of the false pairings of minutiae commonly found by matching algorithms based on linear transforms.