170 likes | 372 Vues
Iris-based Authentication System Daniel Schonberg and Darko Kirovski, “Iris Compression for Cryptographically Secure Person Identification”, in Proceedings of the Data Compression Conference 2004 (DCC’04). Multimedia Security. Outline. Block Diagram of the EyeCert System Related Work
E N D
Iris-based Authentication SystemDaniel Schonberg and Darko Kirovski, “Iris Compression for Cryptographically Secure Person Identification”, in Proceedings of the Data Compression Conference 2004 (DCC’04) Multimedia Security
Outline • Block Diagram of the EyeCert System • Related Work • Iris Detection • Transformation • Feature Extraction • Data Compression • Performance
Related Work • J. Daugman. Recognizing Persons by Their Iris Patterns. Biometrics: Personal Identification in Networked Society, Kluwer Academic Publishers, 1999. • L. Ma, Y. Wang, and T. Tan. Iris Recognition Based on Multichannel Gabor Filtering. Asian Conference on Computer Vision, pp.23–25, 2002. • C.-l. Tisse, et al. Person identification technique using human iris recognition. Journal of System Research, vol.4, pp.67–75, 2003. (Hough transform) • L. Ma, et al. Iris recognition using circular symmetric filters. International Conference on Pattern recognition, vol.2, pp.414–417, 2002.
Iris Detection • Detect the pupil • Detect the outer edge of the iris • Remove the noise (skin, eyelid, eyelashes, etc.)
Transformation • The Fourier Mellin Transform (FMT) • Be related to the Fourier transform
Transformation (cont.) • 2D • Three Steps: • Interpolation (bicubic) • Scaling • Fourier Transform
Transformation (cont.) 256 angles
Feature Extraction • Similarity • Select the proper set of features
Feature Extraction (cont.) Select the top 170 data points of the phase of mFMT to create personal feature vector
Data Compression • There are THREE data-sets that need to be compressed: • The value of the data in the feature vector • The location of the selected mFMT coefficients • The decision threshold
Data Compression (cont.) • The feature vector • -π ≦ θ ≦ π • 5 bits per sample • Total 170 * 5 = 850 bits • The location of the coefficients • Using off-the-shelf point compression algorithm which uses delta-modulation and combinatorial optimization • 6 bits per location • Total 170 * 6 = 1020 bits • The decision threshold • 10 bits per threshold 1880 bits per user
Performance System I – train on all 108 persons within the CASIA database System II – train on a random selected 90 users