Ilaiah Kavati, VamshiKrishna Chenna, M. Prasad, C. Bhagvati
{"title":"用于指纹索引的扩展Delaunay三角分类","authors":"Ilaiah Kavati, VamshiKrishna Chenna, M. Prasad, C. Bhagvati","doi":"10.1109/AMS.2014.38","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an efficient indexing mechanism for the fingerprints based on minutiae triplets. First, we compute the Delaunay triangulation for each fingerprint using the minutiae features. Further, we define a novel representation for the fingerprint named extended triangle set, which is very tolerant to missing minutiae. The defined extended triangle set is an extension of the Delaunay triangulation and is used in combination with a classification approach to narrow down the search space of a fingerprint database. Experiments are conducted on different Fingerprint Verification Competition (FVC) databases and the results show that, while maintaining high hit rate the proposed method achieves lower penetration rate than existing methods.","PeriodicalId":198621,"journal":{"name":"2014 8th Asia Modelling Symposium","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Classification of Extended Delaunay Triangulation for Fingerprint Indexing\",\"authors\":\"Ilaiah Kavati, VamshiKrishna Chenna, M. Prasad, C. Bhagvati\",\"doi\":\"10.1109/AMS.2014.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an efficient indexing mechanism for the fingerprints based on minutiae triplets. First, we compute the Delaunay triangulation for each fingerprint using the minutiae features. Further, we define a novel representation for the fingerprint named extended triangle set, which is very tolerant to missing minutiae. The defined extended triangle set is an extension of the Delaunay triangulation and is used in combination with a classification approach to narrow down the search space of a fingerprint database. Experiments are conducted on different Fingerprint Verification Competition (FVC) databases and the results show that, while maintaining high hit rate the proposed method achieves lower penetration rate than existing methods.\",\"PeriodicalId\":198621,\"journal\":{\"name\":\"2014 8th Asia Modelling Symposium\",\"volume\":\"154 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 8th Asia Modelling Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2014.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 8th Asia Modelling Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2014.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Classification of Extended Delaunay Triangulation for Fingerprint Indexing
In this paper, we propose an efficient indexing mechanism for the fingerprints based on minutiae triplets. First, we compute the Delaunay triangulation for each fingerprint using the minutiae features. Further, we define a novel representation for the fingerprint named extended triangle set, which is very tolerant to missing minutiae. The defined extended triangle set is an extension of the Delaunay triangulation and is used in combination with a classification approach to narrow down the search space of a fingerprint database. Experiments are conducted on different Fingerprint Verification Competition (FVC) databases and the results show that, while maintaining high hit rate the proposed method achieves lower penetration rate than existing methods.