The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Probing the Uniqueness and Randomness of IrisCodes: Results From 200 Billion Iris Pair Comparisons
Abstract
Recent large-scale deployments of iris recognition for border-crossing controls enable critical assessment of the robustness of this technology against making false matches, since vast numbers of cross comparisons become possible within large databases. This paper presents results from the 200 billion iris cross comparisons that could be performed within a database of 632 500 different iris images, spanning 152 nationalities. Each iris pattern was encoded into a phase sequence of 2048 bits using the Daugman algorithms. Empirically analyzing the tail of the resulting distribution of similarity scores enables specification of decision thresholds, and prediction of performance, of the iris recognition algorithms if deployed in identification mode on national scales
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Daugman, J. (2004) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.818350 · Cited by 2,927
Self-citation
Cited by
Image understanding for iris biometrics: A survey
Bowyer, K. W., Hollingsworth, K., & Flynn, P. J. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.08.005 · Cited by 907
50 years of biometric research: Accomplishments, challenges, and opportunities
Jain, A. K., Nandakumar, K., & Ross, A. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2015.12.013 · Cited by 708
Secure and Robust Iris Recognition Using Random Projections and Sparse Representations
Pillai, J. K., Patel, V. M., Chellappa, R., & Ratha, N. K. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.34 · Cited by 324
Biometric Template Protection: Bridging the performance gap between theory and practice
Nandakumar, K., & Jain, A. K. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2427849 · Cited by 322
Metadata
- Authors
- Daugman, J.
- Venue
- Proceedings of the IEEE
- Published
- 2006-11
- Volume
- 94
- Issue
- 11
- Pages
- 1927-1935
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2090425678
- Cited by
- 467
- References
- 1
- FWCI
- 44.66
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
