首页> 外文OA文献 >Iris Identification using Keypoint Descriptors and Geometric Hashing
【2h】

Iris Identification using Keypoint Descriptors and Geometric Hashing

机译:使用关键点描述符和几何散列进行虹膜识别

摘要

Iris is one of the most reliable biometric trait due to its stability and randomness. Conventional recognition systems transform the iris to polar coordinates and perform well for co-operative databases. However, the problem aggravates to manifold for recognizing non-cooperative irises. In addition, the transformation of iris to polar domain introduces aliasing effect. In this thesis, the aforementioned issues are addressed by considering Noise Independent Annular Iris for feature extraction. Global feature extraction approaches are rendered as unsuitable for annular iris due to change in scale as they could not achieve invariance to ransformation and illumination. On the contrary, local features are invariant to image scaling, rotation and partially invariant to change in illumination and viewpoint. To extract local features, Harris Corner Points are detected from iris and matched using novel Dual stage approach. Harris corner improves accuracy but fails to achieve scale invariance. Further, Scale Invariant Feature Transform (SIFT) has been applied to annular iris and results are found to be very promising. However, SIFT is computationally expensive for recognition due to higher dimensional descriptor. Thus, a recently evolved keypoint descriptor called Speeded Up Robust Features (SURF) is applied to mark performance improvement in terms of time as well as accuracy. For identification, retrieval time plays a significant role in addition to accuracy. Traditional indexing approaches cannot be applied to biometrics as data are unstructured. In this thesis, two novel approaches has been developed for indexing iris database. In the first approach, Energy Histogram of DCT coefficients is used to form a B-tree. This approach performs well for cooperative databases. In the second approach, indexing is done using Geometric Hashing of SIFT keypoints. The latter indexing approach achieves invariance to similarity transformations, illumination and occlusion and performs with an accuracy of more than 98% for cooperative as well as non-cooperative databases.
机译:虹膜由于其稳定性和随机性,是最可靠的生物特征之一。传统的识别系统将虹膜转换为极坐标,并且在合作数据库中表现良好。然而,该问题加剧了用于识别非合作性虹膜的多样性。此外,虹膜到极域的转换会引入混叠效果。本文通过考虑噪声无关的环形虹膜特征提取解决了上述问题。由于缩放比例的变化,全局特征提取方法不适合环形虹膜,因为它们无法实现变换和照明的不变性。相反,局部特征对于图像缩放,旋转是不变的,并且对于照明和视点的改变是部分不变的。为了提取局部特征,使用新颖的双阶段方法从虹膜中检测出哈里斯角点并进行匹配。哈里斯角可提高精度,但无法实现比例不变。此外,尺度不变特征变换(SIFT)已应用于环形虹膜,并且发现结果非常有前途。但是,由于具有较高的维度描述符,因此SIFT的识别计算量很大。因此,最近开发的关键点描述符称为加速鲁棒特征(SURF)被应用于在时间和准确性方面标记性能的提高。对于识别,检索时间除准确性外还起着重要作用。由于数据是非结构化的,因此传统的索引方法无法应用于生物统计。本文提出了两种新颖的虹膜数据库索引方法。在第一种方法中,DCT系数的能量直方图用于形成B树。这种方法对于协作数据库效果很好。在第二种方法中,使用SIFT关键点的“几何哈希”完成索引。后者的索引方法实现了相似性变换,照明和遮挡的不变性,并且对于合作和非合作数据库的执行精度都超过98%。

著录项

  • 作者

    Mehrotra Hunny;

  • 作者单位
  • 年度 2010
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号