The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Optimal Randomized RANSAC
Abstract
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution is found in time that is (i) close to the shortest possible and (ii) superior to any deterministic verification strategy. A provably fastest model verification strategy is designed for the (theoretical) situation when the contamination of data by outliers is known. In this case, the algorithm is the fastest possible (on average) of all randomized \\RANSAC algorithms guaranteeing a confidence in the solution. The derivation of the optimality property is based on Wald's theory of sequential decision making, in particular a modified sequential probability ratio test (SPRT). Next, the R-RANSAC with SPRT algorithm is introduced. The algorithm removes the requirement for a priori knowledge of the fraction of outliers and estimates the quantity online. We show experimentally that on standard test data the method has performance close to the theoretically optimal and is 2 to 10 times faster than standard RANSAC and is up to 4 times faster than previously published methods.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
MLESAC: A New Robust Estimator with Application to Estimating Image Geometry
Torr, P. H. S., & Zisserman, A. (2000) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0832 · Cited by 2,396
Chum, O., Matas, J., & Kittler, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45243-0_31 · Cited by 843
Self-citationPreemptive RANSAC for live structure and motion estimation
Nister (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238341 · Cited by 405
Randomized RANSAC with T, test
Matas, J., & Chum, O. (2004) · Image and Vision Computing · doi:10.1016/j.imavis.2004.02.009 · Cited by 281
Self-citationNAPSAC: High Noise, High Dimensional Robust Estimation - it's in the Bag
Myatt, D. R., Torr, P. H. S., Nasuto, S. J., Bishop, J. M., & Craddock, R. (2002) · Procedings of the British Machine Vision Conference 2002 · doi:10.5244/c.16.44 · Cited by 185
Guided Sampling and Consensus for Motion Estimation
Tordoff, B., & Murray, D. W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_6 · Cited by 174
Randomized RANSAC with sequential probability ratio test
Matas, J., & Chum, O. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2005.198 · Cited by 154
Self-citationRandomized RANSAC with T(d,d) test
Matas, J., & Chum, O. (2002) · British Machine Vision Conference (BMVC) · doi:10.5244/c.16.43 · Cited by 144
Self-citationRobust Detection of Degenerate Configurations while Estimating the Fundamental Matrix
Torr, P. H. S., Zisserman, A., & Maybank, S. J. (1998) · Computer Vision and Image Understanding · doi:10.1006/cviu.1997.0559 · Cited by 122
An Effective Bail-out Test for RANSAC Consensus Scoring
Capel, D. (2005) · British Machine Vision Conference (BMVC) · doi:10.5244/c.19.78 · Cited by 86
Epipolar geometry estimation via RANSAC benefits from the oriented epipolar constraint
Chum, O., Werner, T., & Matas, J. (2004) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2004.1334020 · Cited by 55
Self-citation
Cited by
USAC: A Universal Framework for Random Sample Consensus
Raguram, R., Chum, O., Pollefeys, M., Matas, J., & Frahm, J.-M. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.257 · Cited by 676
Self-citationEfficient & Effective Prioritized Matching for Large-Scale Image-Based Localization
Sattler, T., Leibe, B., & Kobbelt, L. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2611662 · Cited by 563
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
Raguram, R., Frahm, J.-M., & Pollefeys, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_37 · Cited by 505
Fast image-based localization using direct 2D-to-3D matching
Sattler, T., Leibe, B., & Kobbelt, L. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126302 · Cited by 480
Understanding the Limitations of CNN-Based Absolute Camera Pose Regression
Sattler, T., Zhou, Q., Pollefeys, M., & Leal-Taixe, L. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00342 · Cited by 418
Metadata
- Authors
- Chum, O., & Matas, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2008-08
- Volume
- 30
- Issue
- 8
- Pages
- 1472-1482
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2057749491
- Cited by
- 438
- References
- 13
- FWCI
- 29.12
- 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.