Issue No. 12 - December (2011 vol. 33)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2011.89
P. J. Flynn , Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
K. W. Bowyer , Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
K. P. Hollingsworth , Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
The most common iris biometric algorithm represents the texture of an iris using a binary iris code. Not all bits in an iris code are equally consistent. A bit is deemed fragile if its value changes across iris codes created from different images of the same iris. Previous research has shown that iris recognition performance can be improved by masking these fragile bits. Rather than ignoring fragile bits completely, we consider what beneficial information can be obtained from the fragile bits. We find that the locations of fragile bits tend to be consistent across different iris codes of the same eye. We present a metric, called the fragile bit distance, which quantitatively measures the coincidence of the fragile bit patterns in two iris codes. We find that score fusion of fragile bit distance and Hamming distance works better for recognition than Hamming distance alone. To our knowledge, this is the first and only work to use the coincidence of fragile bit locations to improve the accuracy of matches.
Iris recognition, Hamming distance, Biometrics, Cameras, score fusion., Iris biometrics, fragile bits
P. J. Flynn, K. W. Bowyer and K. P. Hollingsworth, "Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 2465-2476, 2011.