{"title":"Fingerprint indexing through sparse decomposition of ridge flow patches","authors":"Antoine Deblonde","doi":"10.1109/CIBIM.2014.7015464","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel method for fingerprint indexing based on local patterns of ridge flow centered on minutiae. These local descriptors are projected on a learned dictionary of ridge flow patches, with a sparsity-inducing algorithm. We show that this sparse decomposition allows to replace the ridge flow patches by a compressed signature with a reduced loss of accuracy. We experimented the combination of these descriptors with the formerly known Minutiae Cylinder Code (MCC) descriptor, that provides another kind of local information. Then, we show that the combination of these descriptors performs well for fast nearest neighbor search algorithms based on Locality-Sensitive Hashing (LSH), and allows to either to improve the accuracy of the state-of-the-art algorithm, or to improve its computational efficiency.","PeriodicalId":432938,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Biometrics and Identity Management (CIBIM)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence in Biometrics and Identity Management (CIBIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBIM.2014.7015464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper, we propose a novel method for fingerprint indexing based on local patterns of ridge flow centered on minutiae. These local descriptors are projected on a learned dictionary of ridge flow patches, with a sparsity-inducing algorithm. We show that this sparse decomposition allows to replace the ridge flow patches by a compressed signature with a reduced loss of accuracy. We experimented the combination of these descriptors with the formerly known Minutiae Cylinder Code (MCC) descriptor, that provides another kind of local information. Then, we show that the combination of these descriptors performs well for fast nearest neighbor search algorithms based on Locality-Sensitive Hashing (LSH), and allows to either to improve the accuracy of the state-of-the-art algorithm, or to improve its computational efficiency.