An efficient iris coding based on gauss-laguerre wavelets

12Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper preliminary results of a new iris recognition algorithm using Gauss-Laguerre filter of circular harmonic wavelets are presented. Circular harmonic wavelets (CHWs) applied in this paper for iris pattern extraction, are polar-separable wavelets with harmonic angular shape. The main focus of this paper is on iris coding using Gauss-Laguerre CHWs which constitute a family of orthogonal functions satisfying wavelet admissibility condition required for multiresolution pyramid structure. It is shown that GaussLaguerre wavelets having rich frequency extraction capabilities are powerful tools for coding of iris patterns. By judicious tuning of Laguerre parameters, a 256-byte binary code is generated for each iris. A fast matching scheme based on Hamming distance is used to compute the similarity between pairs of iris codes. Preliminary experimental results on CASIA and our database indicate that the performance of the proposed method is highly accurate with zero false rate and is comparable with Daugman iris recognition algorithm well publisized in literature. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Ahmadi, H., Pousaberi, A., Azizzadeh, A., & Kamarei, M. (2007). An efficient iris coding based on gauss-laguerre wavelets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4642 LNCS, pp. 917–926). Springer Verlag. https://doi.org/10.1007/978-3-540-74549-5_96

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free