2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems最新文献_第7页

Slice-based architecture for biometrics: Prototype illustration on privacy preserving voice verification 基于切片的生物识别体系结构:保护隐私的语音验证的原型说明

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339048

B. Sy

引用次数: 3

Biometric fusion: Does modeling correlation really matter? 生物特征融合:建模相关性真的重要吗?

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339059

K. Nandakumar, A. Ross, Anil K. Jain

引用次数: 30

On assessing the robustness of pen coordinates, pen pressure and pen inclination to time variability with personal entropy 基于个人熵的笔坐标、笔压力和笔倾斜度对时间变化的鲁棒性评估

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339074

N. Houmani, S. Garcia-Salicetti, B. Dorizzi

引用次数: 29

An efficient, two-stage iris recognition system 一种高效的两级虹膜识别系统

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339056

J. Gentile, N. Ratha, J. Connell

{"title":"An efficient, two-stage iris recognition system","authors":"J. Gentile, N. Ratha, J. Connell","doi":"10.1109/BTAS.2009.5339056","DOIUrl":"https://doi.org/10.1109/BTAS.2009.5339056","url":null,"abstract":"There have been claims of very high information content in iris texture, higher even than in fingerprints. This makes iris attractive for large scale identification systems with possibly millions of people. However, some systems operate by performing N 1:1 matches of the probe against the database. This can get prohibitively expensive in terms of computation as N grows large. Note that for identification systems the per-match time dominants system performance, unlike verification where feature extraction time is the primary component. In this paper we show how to use a short-length iris code to pre-screen a large database and thereby reduce the number of full comparisons needed to a fraction of the total. Since the screening code is much smaller than the full iris code, the time to process the whole database is greatly reduced. As an added benefit, we show that we can use the alignment inferred from the short code to greatly restrict the range of alignments searched for the full code, which further speeds up the system. As we demonstrate in experiments, the two stage approach can reduce the cost and/or time needed by an order of magnitude with very little impact on identification performance.","PeriodicalId":325900,"journal":{"name":"2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133221278","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}

引用次数: 51

Improving hand-based verification through online finger template update based on fused confidences 通过基于融合置信度的在线手指模板更新改进手部验证

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339044

G. Amayeh, G. Bebis, M. Nicolescu

{"title":"Improving hand-based verification through online finger template update based on fused confidences","authors":"G. Amayeh, G. Bebis, M. Nicolescu","doi":"10.1109/BTAS.2009.5339044","DOIUrl":"https://doi.org/10.1109/BTAS.2009.5339044","url":null,"abstract":"Since the biometric data tends to have a large intra-class variability, it is possible for the enrolled templates to be significantly different from acquired samples during system's operation. The majority of existing techniques in the literature, namely self update, update a template set by using a confidently verified input sample in order to avoid the introduction of impostors into the template set of a client. Therefore these techniques can only exploit the input sample very similar to the current template set leading to local optimization of a template set. To address this issue, this paper introduces a technique by decomposing the hand silhouette into the different parts (i.e. fingers) and analyzing the confidences of these parts in order to lead to global optimization of templates. In the proposed method, first the hand silhouette is divided in different parts corresponding to the fingers. Then the confidence of each finger, as well as its identity, is evaluated by a Support Vector Data Description (SVDD). The confidence of a query hand is determined by the maximum confidence of all fingers. If the maximum confidence is higher than a threshold, the boundaries of all fingers' SVDDs are incrementally updated to learn the variations of the input data. The motivation behind this technique is that the temporal changes that may occur in the fingers are uncorrelated in such a way that the confidence of each finger can be significantly different from the others. As a result those fingers with difficult intra-class variations (low confidence) can be used in the update process by this technique. The experimental results show the effectiveness of the proposed technique in comparison to the state of the art self-update technique specially at low false acceptance rates.","PeriodicalId":325900,"journal":{"name":"2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133319593","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}

引用次数: 14

GREYC keystroke: A benchmark for keystroke dynamics biometric systems GREYC击键:击键动力学生物识别系统的基准

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339051

R. Giot, Mohamad El-Abed, C. Rosenberger

引用次数: 186

Face alignment by minimizing the closest classification distance 通过最小化最接近的分类距离实现人脸对齐

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339076

H. K. Ekenel, R. Stiefelhagen

{"title":"Face alignment by minimizing the closest classification distance","authors":"H. K. Ekenel, R. Stiefelhagen","doi":"10.1109/BTAS.2009.5339076","DOIUrl":"https://doi.org/10.1109/BTAS.2009.5339076","url":null,"abstract":"In this paper, we present a face registration approach, in which alignment is done by minimizing the closest distance at the classification step. This method eliminates the need of a feature localization step that exists in traditional face recognition systems and formulates alignment as an optimization process during classification. In other words, instead of performing a separate facial feature localization step and localizing facial features according to some type of feature matching score, in the proposed method, alignment is done by directly optimizing the classification score. Moreover, a feature detector can still be integrated to the system. In this case, the output of the feature detector is used as the initial point of the optimization process. Results of extensive experiments have shown that the proposed approach leads very high correct recognition rates, especially in the case of partial face occlusion, where it is not possible to precisely detect the facial feature locations. It has been also found that, in the case of using a facial feature detector, the approach can tolerate localization errors of up to 18% of the interocular distance.","PeriodicalId":325900,"journal":{"name":"2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems","volume":"592 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116176675","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}

引用次数: 3

Parameterized geometric alignment for minutiae-based fingerprint template protection 基于微小指纹模板保护的参数化几何对齐

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339058

Bian Yang, C. Busch

引用次数: 46

Efficient statistical face recognition across pose using Local Binary Patterns and Gabor wavelets 基于局部二值模式和Gabor小波的高效统计人脸识别

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339041

Ngoc-Son Vu, A. Caplier

引用次数: 9

SLIC: Short-length iris codes SLIC:短长度虹膜码

2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems Pub Date : 2009-09-28 DOI: 10.1109/BTAS.2009.5339027

J. Gentile, N. Ratha, J. Connell

引用次数: 54