Thi Huong Thuy Nguyen, H. Xuan, Ky Nguyen Ngoc, Le Minh Khoi
{"title":"一种高效的潜在指纹识别级联系统","authors":"Thi Huong Thuy Nguyen, H. Xuan, Ky Nguyen Ngoc, Le Minh Khoi","doi":"10.1109/RIVF.2013.6719879","DOIUrl":null,"url":null,"abstract":"This paper proposes a cascaded scheme to improve the efficiency of latent fingerprint identification system. In this scheme, the feature set of latent fingerprint such as finger codes, basic patterns, ridge counts and minutia with their local structures are sequentially exploited in four cascaded layers. In the first layer, possible finger codes of latent fingerprint are recognized based on basic pattern features and then reordered to determine their database access priority. In the second layer, its minutiae are extracted and assessed to affine matching in the third layer. In the fourth layer, any case having too many candidates in the previous layer is further matched based on exploiting local structure in order to downsizing the result list. On the verification layer, the minutiae information and local structure of corresponding pairs are presented to human experts for further verification. Experimental results on C@FRIS database show that our proposed method obtains high matching accuracy and considerably low identification time.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An efficient cascaded system for latent fingerprint recognition\",\"authors\":\"Thi Huong Thuy Nguyen, H. Xuan, Ky Nguyen Ngoc, Le Minh Khoi\",\"doi\":\"10.1109/RIVF.2013.6719879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a cascaded scheme to improve the efficiency of latent fingerprint identification system. In this scheme, the feature set of latent fingerprint such as finger codes, basic patterns, ridge counts and minutia with their local structures are sequentially exploited in four cascaded layers. In the first layer, possible finger codes of latent fingerprint are recognized based on basic pattern features and then reordered to determine their database access priority. In the second layer, its minutiae are extracted and assessed to affine matching in the third layer. In the fourth layer, any case having too many candidates in the previous layer is further matched based on exploiting local structure in order to downsizing the result list. On the verification layer, the minutiae information and local structure of corresponding pairs are presented to human experts for further verification. Experimental results on C@FRIS database show that our proposed method obtains high matching accuracy and considerably low identification time.\",\"PeriodicalId\":121216,\"journal\":{\"name\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2013.6719879\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2013.6719879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient cascaded system for latent fingerprint recognition
This paper proposes a cascaded scheme to improve the efficiency of latent fingerprint identification system. In this scheme, the feature set of latent fingerprint such as finger codes, basic patterns, ridge counts and minutia with their local structures are sequentially exploited in four cascaded layers. In the first layer, possible finger codes of latent fingerprint are recognized based on basic pattern features and then reordered to determine their database access priority. In the second layer, its minutiae are extracted and assessed to affine matching in the third layer. In the fourth layer, any case having too many candidates in the previous layer is further matched based on exploiting local structure in order to downsizing the result list. On the verification layer, the minutiae information and local structure of corresponding pairs are presented to human experts for further verification. Experimental results on C@FRIS database show that our proposed method obtains high matching accuracy and considerably low identification time.