12 October 2006 Iris recognition with compact zero-crossing-based coding
Author Affiliations +
Proceedings Volume 6347, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2006; 634723 (2006) https://doi.org/10.1117/12.714578
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2006, 2006, Wilga, Poland
Abstract
We propose an iris recognition technique using transformation of the iris image into a binary sequence that represents zero-crossing points of the filtered image by way of Laplacian of Gaussians. Novel iris localization and occlusion detection methods are developed to transform the iris image into the sequence of 1D stripes. The proposed enrollment procedure includes an independent selection of iris stripes among a number of enrollment images to minimize the recognition errors. The eyeball spontaneous rotation is corrected at the verification stage. The methodology was tested with a local database of 180 different irises, revealing the EER (Equal Error Rate) at the level of 0.03%.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Adam Czajka, Adam Czajka, Przemek Strzelczyk, Przemek Strzelczyk, } "Iris recognition with compact zero-crossing-based coding", Proc. SPIE 6347, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2006, 634723 (12 October 2006); doi: 10.1117/12.714578; https://doi.org/10.1117/12.714578
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Fingerprint + Iris = IrisPrint
Proceedings of SPIE (May 13 2015)
An iris recognition algorithm based on DCT and GLCM
Proceedings of SPIE (May 05 2008)
SIFT based iris feature extraction and matching
Proceedings of SPIE (July 24 2007)
Advances in the biometric recognition methods a survey on...
Proceedings of SPIE (February 26 2010)
Tools for quality control of fingerprint databases
Proceedings of SPIE (April 14 2010)

Back to Top