On the commonality of iris biometrics

  • Authors:
  • Parman Sukarno;Nandita Bhattacharjee;Bala Srinivasan

  • Affiliations:
  • Monash University, Clayton, Victoria, Australia;Monash University, Clayton, Victoria, Australia;Monash University, Clayton, Victoria, Australia

  • Venue:
  • Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Biometric fuzziness occurs due to variations during data acquisitions and degrades the performance of the iris biometric system. Most of the proposed techniques overcome the fuzziness by removing some parts of the biometric image and/or using image processing methods which are usually computationally inefficient. However, we approach the problem from a post-processing perspective and we start our work with the raw binary iris codes. Our approach is based on the concept of commonality between two codes. The common substrings extract significant structural similarities and the misalignment distance accounts for rotational inconsistencies. This research explores how the length of common substrings can be used as a metric of similarity of iris biometric. We tested our metric using commercial Bath dataset and noticed that it achieves an EER of 1.3%, is robust at handling heterogonous biometric, and is more suitable for low FAR-based applications compared to the widely used Hamming Distance.