Pub Date : 2011-12-05DOI: 10.1109/ICHB.2011.6094297
M. Petrelli, S. Elliott, Carl Dunkelberger
The impact of force on acquiring a high quality fingerprint image has been systematically studied by researchers using single print optical scanners. A previous study examined force levels that ranged from 3N to 21N using a single print optical sensor. A second experiment used force levels ranging from 3N to 11N using a capacitive and optical single print sensor. Additional work has been conducted that looked at smaller increments of force also using an optical sensor. This paper contributes to the body of knowledge by using an alternative fingerprint sensor, an alternative force level and compares it to the auto-capture method.
{"title":"The Impact of Force on Fingerprint Image Quality, Minutiae Count and Performance","authors":"M. Petrelli, S. Elliott, Carl Dunkelberger","doi":"10.1109/ICHB.2011.6094297","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094297","url":null,"abstract":"The impact of force on acquiring a high quality fingerprint image has been systematically studied by researchers using single print optical scanners. A previous study examined force levels that ranged from 3N to 21N using a single print optical sensor. A second experiment used force levels ranging from 3N to 11N using a capacitive and optical single print sensor. Additional work has been conducted that looked at smaller increments of force also using an optical sensor. This paper contributes to the body of knowledge by using an alternative fingerprint sensor, an alternative force level and compares it to the auto-capture method.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132226781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-05DOI: 10.1109/ICHB.2011.6094323
Lin Zhang, Hongyu Li, Ying Shen
It is well recognized that in biometric systems feature extraction and representation are key considerations. Among various feature extraction and representation schemes, coding-based methods are most attractive because they have the merits of high accuracy, robustness, compactness and high matching speed, and thus they have been adopted in many different kinds of biometric systems, such as iris, palmprint, and finger-knuckle-print (FKP) systems. However, how to devise a good coding scheme for FKP recognition is still an open issue. In this paper, based on the finding that Riesz transforms can well characterize the visual patterns, we propose to encode the local patches of an FKP image by using 2nd-order Riesz transforms. Specifically, we propose a 6-bits coding scheme, namely RieszCompCode, which consists of 6 bit-planes. In RieszCompCode, three of the bit-planes are obtained by binarizing the image's responses to the three 2nd-order Riesz transforms, and the other three ones are from the classical CompCode scheme. Experiments conducted on the benchmark PolyU FKP database corroborate that the proposed RieszComopCode can surpass all the other coding schemes evaluated for FKP verification in terms of verification accuracy.
{"title":"A Novel Riesz Transforms Based Coding Scheme for Finger-Knuckle-Print Recognition","authors":"Lin Zhang, Hongyu Li, Ying Shen","doi":"10.1109/ICHB.2011.6094323","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094323","url":null,"abstract":"It is well recognized that in biometric systems feature extraction and representation are key considerations. Among various feature extraction and representation schemes, coding-based methods are most attractive because they have the merits of high accuracy, robustness, compactness and high matching speed, and thus they have been adopted in many different kinds of biometric systems, such as iris, palmprint, and finger-knuckle-print (FKP) systems. However, how to devise a good coding scheme for FKP recognition is still an open issue. In this paper, based on the finding that Riesz transforms can well characterize the visual patterns, we propose to encode the local patches of an FKP image by using 2nd-order Riesz transforms. Specifically, we propose a 6-bits coding scheme, namely RieszCompCode, which consists of 6 bit-planes. In RieszCompCode, three of the bit-planes are obtained by binarizing the image's responses to the three 2nd-order Riesz transforms, and the other three ones are from the classical CompCode scheme. Experiments conducted on the benchmark PolyU FKP database corroborate that the proposed RieszComopCode can surpass all the other coding schemes evaluated for FKP verification in terms of verification accuracy.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-05DOI: 10.1109/ICHB.2011.6094317
I. Bakina, L. Mestetskiy
The article proposes a new approach to hand shape recognition that allows comparison of hands with separated fingers as well as with touching fingers. The idea is to construct a flexible hand model from the set of hand images in different poses. This model allows us to simulate different hand transformations (for example, rotations of fingers) and analyze hand shape after them. Person recognition is performed by matching the reference model to a test hand image. The proposed similarity measure is normalized symmetric difference between superposed silhouettes of test hand and transformed reference hand. The article also introduces a~prototype of peg-free person recognition system based on the proposed approach and experimental results on real data.
{"title":"Hand Shape Recognition from Natural Hand Position","authors":"I. Bakina, L. Mestetskiy","doi":"10.1109/ICHB.2011.6094317","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094317","url":null,"abstract":"The article proposes a new approach to hand shape recognition that allows comparison of hands with separated fingers as well as with touching fingers. The idea is to construct a flexible hand model from the set of hand images in different poses. This model allows us to simulate different hand transformations (for example, rotations of fingers) and analyze hand shape after them. Person recognition is performed by matching the reference model to a test hand image. The proposed similarity measure is normalized symmetric difference between superposed silhouettes of test hand and transformed reference hand. The article also introduces a~prototype of peg-free person recognition system based on the proposed approach and experimental results on real data.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130592434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-05DOI: 10.1109/ICHB.2011.6094353
Bian Yang, C. Busch, K.T.J. de Groot, Hai-yun Xu, R. Veldhuis
In a biometric template protected authentication system, a pseudonymous identifier is the part of a protected biometric template that can be compared directly against other pseudonymous identifiers. Each compared pair of pseudonymous identifiers results in a verification decision testing whether both attributes are derived from the same individual. Compared to an unprotected system, most existing biometric template protection methods cause to a certain extent, degradation in biometric performance. Therefore fusion is a promising method to enhance the biometric performance in template protected systems. Compared to feature level fusion and score level fusion, decision level fusion exhibits not only the least fusion complexity, but also the maximum interoperability across different biometric features, systems based on scores, and even individual algorithms. However, performance improvement via decision level fusion is not obvious. It is influenced by both the dependency and the performance gap among the conducted tests for fusion. We investigate in this paper several scenarios (multi-sample, multi-instance, multi- sensor, and multi-algorithm) when fusion is performed on binary decisions obtained from verification of fingerprint minutiae based pseudonymous identifiers. We demonstrate the influence on biometric performance from decision level fusion in different fusion scenarios on a multi-sensor fingerprint database.
{"title":"Decision Level Fusion of Fingerprint Minutiae Based Pseudonymous Identifiers","authors":"Bian Yang, C. Busch, K.T.J. de Groot, Hai-yun Xu, R. Veldhuis","doi":"10.1109/ICHB.2011.6094353","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094353","url":null,"abstract":"In a biometric template protected authentication system, a pseudonymous identifier is the part of a protected biometric template that can be compared directly against other pseudonymous identifiers. Each compared pair of pseudonymous identifiers results in a verification decision testing whether both attributes are derived from the same individual. Compared to an unprotected system, most existing biometric template protection methods cause to a certain extent, degradation in biometric performance. Therefore fusion is a promising method to enhance the biometric performance in template protected systems. Compared to feature level fusion and score level fusion, decision level fusion exhibits not only the least fusion complexity, but also the maximum interoperability across different biometric features, systems based on scores, and even individual algorithms. However, performance improvement via decision level fusion is not obvious. It is influenced by both the dependency and the performance gap among the conducted tests for fusion. We investigate in this paper several scenarios (multi-sample, multi-instance, multi- sensor, and multi-algorithm) when fusion is performed on binary decisions obtained from verification of fingerprint minutiae based pseudonymous identifiers. We demonstrate the influence on biometric performance from decision level fusion in different fusion scenarios on a multi-sensor fingerprint database.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123706598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-05DOI: 10.1109/ICHB.2011.6094326
R. Belguechi, E. Cherrier, Mohamad El Abed, C. Rosenberger
With more and more applications using biometrics, new privacy and security risks arise. Some new biometric systems have been proposed in the last decade following a privacy by design approach: cancelable biometric systems. Their evaluation is still an open issue in research. The objective of this paper is first to define an evaluation methodology for these particular biometric systems by proposing some metrics for testing their robustness. Second, we show through the example of a cancelable biometric system using finger-knuckle-prints how some privacy properties can be checked by simulating attacks.
{"title":"Evaluation of Cancelable Biometric Systems: Application to Finger-Knuckle-Prints","authors":"R. Belguechi, E. Cherrier, Mohamad El Abed, C. Rosenberger","doi":"10.1109/ICHB.2011.6094326","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094326","url":null,"abstract":"With more and more applications using biometrics, new privacy and security risks arise. Some new biometric systems have been proposed in the last decade following a privacy by design approach: cancelable biometric systems. Their evaluation is still an open issue in research. The objective of this paper is first to define an evaluation methodology for these particular biometric systems by proposing some metrics for testing their robustness. Second, we show through the example of a cancelable biometric system using finger-knuckle-prints how some privacy properties can be checked by simulating attacks.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115138394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ichb.2011.6094350
Jianjiang Feng, Jie Zhou
{"title":"A Performance Evaluation of Fingerprint Minutia Descriptors","authors":"Jianjiang Feng, Jie Zhou","doi":"10.1109/ichb.2011.6094350","DOIUrl":"https://doi.org/10.1109/ichb.2011.6094350","url":null,"abstract":"","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122895731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ICHB.2011.6094352
O. Ushmaev, V. Kuznetsov, V. Gudkov
We propose a technique of extraction repeatable binary string from fingerprint images. We extract binary features from topological relations between minutiae points. For an arbitrary minutiae point we trace neighboring ridges until we encounter event: minutiae or projection of minutiae. Then we encode these events. Thus we obtain 50-100 bit descriptions for each minutiae point. In order to extract longer binary string, we propose two techniques. First, we select 2^l binary strings (centers) of the same length as topological descriptor. Then for each minutiae descriptor we select k nearest centers. Selected subset of centers is represented by 2^l bit long binary string. The self-aligned technique has significant errors (FRR=30% at FAR=0.1%). The second tehnique requires public helper. We concatenate descriptions of 5-8 minutiae points. Data that are necessary to find and order minutiae subset is stored in a public helper. Thus we extracted 384-512 bit binary string with approximately 20% erroneous bits. Errors are corrected using two-layer BCH-major voting codes. Experiments on FVC2002DB1 dataset and private dataset (100 different fingers, with 3 samples per finger) show that 20-40 bit error-free binary string can be reproduced from genuine fingerprint with 90% success rate.
{"title":"Extraction of Binary Features from Fingerprint Topology","authors":"O. Ushmaev, V. Kuznetsov, V. Gudkov","doi":"10.1109/ICHB.2011.6094352","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6094352","url":null,"abstract":"We propose a technique of extraction repeatable binary string from fingerprint images. We extract binary features from topological relations between minutiae points. For an arbitrary minutiae point we trace neighboring ridges until we encounter event: minutiae or projection of minutiae. Then we encode these events. Thus we obtain 50-100 bit descriptions for each minutiae point. In order to extract longer binary string, we propose two techniques. First, we select 2^l binary strings (centers) of the same length as topological descriptor. Then for each minutiae descriptor we select k nearest centers. Selected subset of centers is represented by 2^l bit long binary string. The self-aligned technique has significant errors (FRR=30% at FAR=0.1%). The second tehnique requires public helper. We concatenate descriptions of 5-8 minutiae points. Data that are necessary to find and order minutiae subset is stored in a public helper. Thus we extracted 384-512 bit binary string with approximately 20% erroneous bits. Errors are corrected using two-layer BCH-major voting codes. Experiments on FVC2002DB1 dataset and private dataset (100 different fingers, with 3 samples per finger) show that 20-40 bit error-free binary string can be reproduced from genuine fingerprint with 90% success rate.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115480682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICHB.2011.6172276
Zhenhua Guo, Gang Wu, QingWen Chen, Wenhuang Liu
The development of accurate and robust palmprint recognition algorithm is a critical issue in automatic palmprint recognition system. In this paper, we propose a palmprint recognition method based on a two-phase test sample sparse representation. In the first phase, a test sample is represented as a linear combination of all the training samples and m "nearest neighbors" are selected based on the representation ability. In the second phase, the test sample is represented as a linear combination of the determined m nearest neighbors and the representation result is used for classification. Experimental results on PolyU database show the effectiveness of the proposed method in terms of recognition rate.
{"title":"Palmprint recognition by a two-phase test sample sparse representation","authors":"Zhenhua Guo, Gang Wu, QingWen Chen, Wenhuang Liu","doi":"10.1109/ICHB.2011.6172276","DOIUrl":"https://doi.org/10.1109/ICHB.2011.6172276","url":null,"abstract":"The development of accurate and robust palmprint recognition algorithm is a critical issue in automatic palmprint recognition system. In this paper, we propose a palmprint recognition method based on a two-phase test sample sparse representation. In the first phase, a test sample is represented as a linear combination of all the training samples and m \"nearest neighbors\" are selected based on the representation ability. In the second phase, the test sample is represented as a linear combination of the determined m nearest neighbors and the representation result is used for classification. Experimental results on PolyU database show the effectiveness of the proposed method in terms of recognition rate.","PeriodicalId":378764,"journal":{"name":"2011 International Conference on Hand-Based Biometrics","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：