Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1186
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorKong, WKA-
dc.creatorZhang, DD-
dc.creatorKamel, M-
dc.date.accessioned2014-12-11T08:23:29Z-
dc.date.available2014-12-11T08:23:29Z-
dc.identifier.isbn0-7695-2521-0-
dc.identifier.urihttp://hdl.handle.net/10397/1186-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.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.en_US
dc.rightsThis 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.en_US
dc.subjectFunction evaluationen_US
dc.subjectHamming distanceen_US
dc.subjectImage codingen_US
dc.subjectPattern matchingen_US
dc.titleAn anatomy of IrisCode for precise phase representationen_US
dc.typeConference Paperen_US
dc.description.otherinformationAuthor name used in this publication: Adams Kongen_US
dc.description.otherinformationAuthor name used in this publication: David Zhangen_US
dc.description.otherinformationBiometrics Research Centre, Department of Computingen_US
dc.description.otherinformationRefereed conference paperen_US
dcterms.abstractIrisCode, 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationThe 18th International Conference on Pattern Recognition : 20-24 August, 2006, Hong Kong : proceedings, v. 4, p. 429-432-
dcterms.issued2006-
dc.identifier.scopus2-s2.0-34147095320-
dc.identifier.rosgroupidr30314-
dc.description.ros2006-2007 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
phase-representation_06.pdf131.55 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

126
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

156
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Mar 29, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.