The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Graph-Cut RANSAC
Abstract
A novel method for robust estimation, called Graph-Cut RANSAC1, GC-RANSAC in short, is introduced. To separate inliers and outliers, it runs the graph-cut algorithm in the local optimization (LO) step which is applied when a so-far-the-best model is found. The proposed LO step is conceptually simple, easy to implement, globally optimal and efficient. GC-RANSAC is shown experimentally, both on synthesized tests and real image pairs, to be more geometrically accurate than state-of-the-art methods on a range of problems, e.g. line fitting, homography, affine transformation, fundamental and essential matrix estimation. It runs in real-time for many problems at a speed approximately equal to that of the less accurate alternatives (in milliseconds on standard CPU).
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
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Robust wide-baseline stereo from maximally stable extremal regions
Matas, J., Chum, O., Urban, M., & Pajdla, T. (2004) · Image and Vision Computing · doi:10.1016/j.imavis.2004.02.006 · Cited by 3,686
Self-citationWhat energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Multiple view geometry in computer vision
Opower, H. (2002) · Optics and Lasers in Engineering · doi:10.1016/s0143-8166(01)00145-2 · Cited by 3,007
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640
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
In defense of the eight-point algorithm
Hartley, R. I. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.601246 · Cited by 1,625
Matching with PROSAC — Progressive Sample Consensus
Chum, O., & Matas, J. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.221 · Cited by 1,096
Self-citation"GrabCut": interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015720 · Cited by 935
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-citationUSAC: 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-citationMarkov random fields with efficient approximations
Boykov, Y., Veksler, O., & Zabih, R. (2002) · Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231) · doi:10.1109/cvpr.1998.698673 · Cited by 422
Energy-Based Geometric Multi-model Fitting
Isack, H., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0474-7 · Cited by 318
The multiRANSAC algorithm and its application to detect planar homographies
Zuliani, M., Kenney, C. S., & Manjunath, B. S. (2005) · IEEE International Conference on Image Processing 2005 · doi:10.1109/icip.2005.1530351 · Cited by 288
Pritchett, P., & Zisserman, A. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710802 · Cited by 279
Change Detection in Optical Aerial Images by a Multilayer Conditional Mixed Markov Model
Benedek, C., & Sziranyi, T. (2009) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2009.2022633 · Cited by 260
Fixing the Locally Optimized RANSAC
Lebeda, K., Matas, J., & Chum, O. (2012) · Procedings of the British Machine Vision Conference 2012 · doi:10.5244/c.26.95 · Cited by 209
Self-citationOutlier detection and motion segmentation:
Torr, P. H. S., & Murray, D. W. (1993) · SPIE Proceedings · doi:10.1117/12.150246 · Cited by 205
A survey on image mosaicing techniques
Ghosh, D., & Kaabouch, N. (2015) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2015.10.014 · Cited by 200
NAPSAC: 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
MODS: Fast and robust method for two-view matching
Mishkin, D., Matas, J., & Perdoch, M. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.08.005 · Cited by 158
Self-citationSpatially coherent clustering using graph cuts
Zabih, R., & Kolmogorov, V. (2004) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2004.1315196 · Cited by 136
Wide-baseline stereo from multiple views: a probabilistic account
Strecha, C., Fransens, R., & Gool, L. V. (2004) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2004.1315080 · Cited by 131
Robust 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
EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory
Fragoso, V., Sen, P., Rodriguez, S., & Turk, M. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.307 · Cited by 91
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-citationAn Exact Penalty Method for Locally Convergent Maximum Consensus
Le, H., Chin, T.-J., & Suter, D. (2017) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2017.48 · Cited by 38
Cited by
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
Linking Points With Labels in 3D: A Review of Point Cloud Semantic Segmentation
Xie, Y., Tian, J., & Zhu, X. X. (2020) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2019.2937630 · Cited by 482
Image matching across wide baselines: From paper to practice
Jin, Y., Mishkin, D., Mishchuk, A., Matas, J., Fua, P., Yi, K. M., & Trulls, E. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01385-0 · Cited by 388
Self-citationPointDSC: Robust Point Cloud Registration using Deep Spatial Consistency
Bai, X., Luo, Z., Zhou, L., Chen, H., Li, L., Hu, Z., Fu, H., & Tai, C.-L. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01560 · Cited by 366
MAGSAC++, a Fast, Reliable and Accurate Robust Estimator
Barath, D., Noskova, J., Ivashechkin, M., & Matas, J. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00138 · Cited by 340
Self-citation
Metadata
- Authors
- Barath, D., & Matas, J.
- Venue
- 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2018-06
- Pages
- 6733-6741
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2962828767
- Cited by
- 352
- References
- 30
- FWCI
- 7.54
- 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.