首页> 外文期刊>Information Forensics and Security, IEEE Transactions on >Efficient and Accurate At-a-Distance Iris Recognition Using Geometric Key-Based Iris Encoding
【24h】

Efficient and Accurate At-a-Distance Iris Recognition Using Geometric Key-Based Iris Encoding

机译:使用基于几何密钥的虹膜编码进行高效,准确的远距离虹膜识别

获取原文
获取原文并翻译 | 示例
           

摘要

Accurate iris recognition from the distantly acquired face or eye images under less constrained environments require development of specialized strategies which can accommodate for significant image variations (e.g., scale, rotation, translation) and influence from multiple noise sources. A set of coordinate-pairs, which is referred to as geometric key in this paper is randomly generated and exclusively assigned to each subject enrolled into the system. Such geometric key uniquely defines the way how the iris features are encoded from the localized iris region pixels. Such iris encoding scheme involves computationally efficient and fast comparison operation on the locally assembled image patches using the locations defined by the geometric key. The image patches involved in such operation can be more tolerant to the noise. Scale and rotation changes in the localized iris region can be well accommodated by using the transformed geometric key. The binarized encoding of such local iris features still allows efficient computation of their similarity using Hamming distance. The superiority of the proposed iris encoding and matching strategy is ascertained by providing comparison with several state-of-the-art iris encoding and matching algorithms on three publicly available databases: UBIRIS.v2, FRGC, CASIA.v4-distance, which suggests the average improvements of 36.3%, 32.7%, and 29.6% in equal error rates, respectively, as compared with several competing approaches.
机译:在较少约束的环境下从远距离获取的面部或眼睛图像中准确识别虹膜需要开发专门的策略,这些策略可以适应重大的图像变化(例如,缩放,旋转,平移)并受到多种噪声源的影响。随机生成一组坐标对,在本文中称为几何键,并将其专门分配给注册到系统中的每个主题。这样的几何键唯一地定义了如何从局部虹膜区域像素编码虹膜特征的方式。这种虹膜编码方案涉及使用由几何键定义的位置对本地组装的图像块进行计算上有效且快速的比较操作。此类操作中涉及的图像补丁可能更能容忍噪声。通过使用变形的几何关键点,可以很好地适应局部虹膜区域中的缩放和旋转变化。这样的局部虹膜特征的二值化编码仍然允许使用汉明距离有效地计算它们的相似性。通过在三个公共数据库:UBIRIS.v2,FRGC,CASIA.v4-distance上与几种最新的虹膜编码和匹配算法进行比较,可以确定所提出的虹膜编码和匹配策略的优越性。与几种竞争方法相比,平均错误率分别平均提高了36.3%,32.7%和29.6%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号