The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
Abstract
In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its postrecognition score analysis form through the use of the statistical extreme value theory (EVT). The ability to predict the performance of a recognition system based on its outputs for each match instance is desirable for a number of important reasons, including automatic threshold selection for determining matches and nonmatches, and automatic algorithm selection or weighting for multi-algorithm fusion. The emerging body of literature on postrecognition score analysis has been largely constrained to biometrics, where the analysis has been shown to successfully complement or replace image quality metrics as a predictor. We develop a new statistical predictor based upon the Weibull distribution, which produces accurate results on a per instance recognition basis across different recognition problems. Experimental results are provided for two different face recognition algorithms, a fingerprint recognition algorithm, a SIFT-based object recognition system, and a content-based image retrieval system.
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Cited by
Towards Open Set Deep Networks
Bendale, A., & Boult, T. E. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.173 · Cited by 1,799
Self-citationBranchyNet: Fast inference via early exiting from deep neural networks
Teerapittayanon, S., McDanel, B., & Kung, H. T. (2016) · 2016 23rd International Conference on Pattern Recognition (ICPR) · doi:10.1109/icpr.2016.7900006 · Cited by 1,326
Probability Models for Open Set Recognition
Scheirer, W. J., Jain, L. P., & Boult, T. E. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321392 · Cited by 630
Self-citationClassification-Reconstruction Learning for Open-Set Recognition
Yoshihashi, R., Shao, W., Kawakami, R., You, S., Iida, M., & Naemura, T. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00414 · Cited by 472
Generative OpenMax for Multi-Class Open Set Classification
Ge, Z., Demyanov, S., & Garnavi, R. (2017) · Procedings of the British Machine Vision Conference 2017 · doi:10.5244/c.31.42 · Cited by 472
“Formalization for open space risk is considered as the relative measure of open space compared to the overall measure space: R open = Unknown Space ( Known Space + Unknown Open Space ) Several recent solutions to multi-class open set problem convert it into a score calibration task [17, 23, 27].”
BackgroundMulti-class Open Set Recognition Using Probability of Inclusion
Jain, L. P., Scheirer, W. J., & Boult, T. E. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_26 · Cited by 340
Self-citationRudd, E. M., Jain, L. P., Scheirer, W. J., & Boult, T. E. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2707495 · Cited by 326
Self-citationNearest neighbors distance ratio open-set classifier
Mendes Júnior, P. R., de Souza, R. M., Werneck, R. D. O., Stein, B. V., Pazinato, D. V., de Almeida, W. R., Penatti, O. A. B., Torres, R. D. S., & Rocha, A. (2017) · Machine Learning · doi:10.1007/s10994-016-5610-8 · Cited by 276
Self-citation
Metadata
- Authors
- Scheirer, W. J., Rocha, A., Micheals, R. J., & Boult, T. E.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2011-08
- Volume
- 33
- Issue
- 8
- Pages
- 1689-1695
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2100332042
- Cited by
- 211
- References
- 1
- FWCI
- 12.55
- 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.