Synonyms
Bit fragility; Bit inconsistency; Fragile bits
Definition
The characteristic of iris code bits values being inconsistent (also referred to as fragile) across different images of the same iris was explored by Hollingsworth et al. [1]. The notion of fragile bits was first suggested by Bolle et al. [2] when it was observed that the empirical false reject rate (FRR) was significantly better than predicted by their theoretical model. This fact implied that the bits of an iris code are not equally susceptible to “flip,” given different environmental conditions that affect the quality of the captured iris images. Hollingsworth et al. demonstrated that by eliminating (masking) inconsistent bits, one could dramatically improve the FRR of an iris template.
Although the work of Hollingsworth et al. improves the FRR by identifying and removing fragile bits, our preliminary results show that it may be possible, based on bit instability, to further reduce the number of iris code bits needed...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
K. Hollingsworth, K. Bowyer, P. Flynn, All iris code bits are not created equal, in 2007 IEEE Conference on Biometrics: Theory, Applications, and Systems, Washington DC, Sept 2007
R.M. Bolle, S. Pankanti, J.H. Connell, N. Ratha, Iris individuality: a partial iris model, in Proceedings of the 17th International Conference on Pattern Recognition, Cambridge, 2004, vol. 2, pp. 927–930
L. Davis, Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991)
G. Dozier, A. Homaifar, E. Tunstel, D. Battle, An introduction to evolutionary computation (chapter 17), in Intelligent Control Systems Using Soft Computing Methodologies, ed. by A. Zilouchian, M. Jamshidi (CRC, Boca Raton, 2001), pp. 365–380
D.B. Fogel, Evolutionary computation: toward a new philosophy of machine intelligence, 2nd edn. (IEEE, Las Alomitas, 2000)
D.E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning (Addison-Wesley Publishing Company, Inc., Reading, 1989)
J. Daugman, How iris recognition works. IEEE Trans. Circ. Syst. Video Technol. 14(1), 21–30 (2004)
G. Syswerda, Uniform crossover in genetic algorithms, in Proceedings of the Third International Conference on Genetic Algorithms (ICGA-89), San Mateo, ed. by S. David (Morgan Kaufmann, San Francisco, 1989), pp. 2–9
S.M. Thornton, V. Kumar, Robust iris recognition using advanced correlation techniques, in Proceedings of the International Conference On Image Analysis and Recognition, Toronto, 2005, pp. 1098–1105
J. Daugman, High confidence visual recognition of persons by a test of statistical independence. IEEE Trans. Pattern Anal. 15(11), 1148–1161 (1993)
Iris Challenge Evaluation. National Institute of Standards and Technology (2006), http://iris.nist.gov/ICE/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Dozier, G.V., Savvides, M., Bryant, K., Munemoto, T., Ricanek, K., Woodard, D.L. (2015). Iris Template Extraction Via Bit Inconsistency and GRIT. In: Li, S.Z., Jain, A.K. (eds) Encyclopedia of Biometrics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7488-4_165
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7488-4_165
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7487-7
Online ISBN: 978-1-4899-7488-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering