The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
NAPSAC: High Noise, High Dimensional Robust Estimation - it's in the Bag
Abstract
An umber of the most powerful robust estimation algorithms, such as RANSAC, MINPRAN and LMS ,h ave their basis in selecting random minimal sets of data to instantiate hypotheses. However, their performance degrades in higher dimensional spaces due to the exponentially decreasing probability of sampling a set that is composed entirely of inliers. In order to overcome this, rather than picking sets at random, a new strategy is proposed that alters the way samples are taken, under the assumption that inliers will tend to be closer to one another than outliers. Based on this premise, the NAPSAC (N Adjacent Points SAmple Consensus) algorithm is derived and its performance is shown to be superior to RANSAC in both high noise and high dimensional spaces.
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
Cited by
Efficient RANSAC for Point‐Cloud Shape Detection
Schnabel, R., Wahl, R., & Klein, R. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01016.x · Cited by 2,106
Image Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Chum, O., Matas, J., & Kittler, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45243-0_31 · Cited by 843
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
Chum, O., & Matas, J. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70787 · Cited by 438
Metadata
- Authors
- Myatt, D. R., Torr, P. H. S., Nasuto, S. J., Bishop, J. M., & Craddock, R.
- Venue
- Procedings of the British Machine Vision Conference 2002
- Publisher
- British Machine Vision Association
- Published
- 2002
- Pages
- 44.1-44.10
- OpenAlex
- W2026375818
- Cited by
- 185
- References
- 1
- FWCI
- 1.81
- Type
- conference paper
- 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.