PolyU Institutional Repository >
COMP Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||An anatomy of IrisCode for precise phase representation|
|Authors: ||Kong, Wai-kin Adams|
Zhang, David D.
|Subjects: ||Function evaluation|
|Issue Date: ||2006 |
|Publisher: ||IEEE Computer Society|
|Citation: ||The 18th International Conference on Pattern Recognition : 20-24 August, 2006, Hong Kong : proceedings, v. 4, p. 429-432.|
|Abstract: ||IrisCode, a widely deployed iris recognition algorithm, developed in 1993 and continuously modified by Daugman has attracted considerable attentions. IrisCode using a coarse phase representation has number of properties such as rapid matching, binomial imposter distribution and predictable false acceptance rate. Although many similar coding methods have been developed for irises and palmprints based on IrisCode, a theoretical analysis of IrisCode has not been provided. In this paper, we aim at studying (1) the nature of IrisCode, (2) the property of the phase of Gabor function, (3) the extension of bitwise hamming distance and (4) the theoretical foundation of the binomial imposter distribution and extending the coarse phase representation to a precise phase representation. Precisely, we demonstrate that IrisCode is a clustering algorithm with four prototypes; the locus of a Gabor function is a two-dimensional ellipse with respect to the phase parameter and bitwise hamming can be regarded as angular distance. Using these properties, we provide a precise phase representation for IrisCode with an effective implementation for filtering and matching. Practically, the imposter distribution of IrisCode follows binomial distribution. However, the theoretical evidence is incomplete according to our analysis.|
|Rights: ||© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||COMP Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.