TechRxiv
On_Capacity_of_IrisCodes_TechRxiv.pdf (183.45 kB)

Iris Code Capacity Analysis

Download (183.45 kB)
preprint
posted on 11.08.2021, 13:16 by Jinyu ZuoJinyu Zuo, Natalia Schmid
Daugman’s design of IrisCode continues fascinating the research world with its practicality, efficiency, and outstanding performance. The limits of Daugman’s recognition system, however, remain unquantified. Multiple approaches to scale performance have been explored in the past. Despite them, the problem of finding the capacity of IrisCode remains open.
In an attempt to fill the gap in understanding the performance limits of Daugman’s algorithm, we turn to an analysis of the relationship between the size of the population that the IrisCode can effectively cover and the iris sample quality. Given Daugman’s IrisCode algorithm, the problem of finding its capacity is cast as a basic Rate-Distortion/Channel Coding problem. The Hamming, Plotkin, and Elias-Bassalygo upper bounds on the population of a binary code under the constraint of a minimum Hamming Distance between any two codewords is applied to relate the number of iris classes that the IrisCode algorithm can sustain and the quality of iris data expressed in terms of Hamming Distance.

History

Email Address of Submitting Author

jzuo@mix.wvu.edu

Submitting Author's Institution

West Virginia University

Submitting Author's Country

United States of America