Graph-Cut RANSAC

By Daniel Barath, Jiri Matas. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2017

391 citations recorded by the source corpus.

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).

Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/6c0f45f3f05265f72ccce3448530a84fbc7816a7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

  1. Eduard Trulls
  2. Kwang Moo Yi
  3. Pascal Fua
  4. Jiri Matas
  5. Dmytro Mishkin
  6. Anastasiia V. Mishchuk
  7. Marc Pollefeys
  8. Zixin Luo

In Computer Vision and Pattern Recognition

  1. Eduard Trulls
  2. Pascal Fua
  3. Kwang Moo Yi
  4. Luc Van Gool
  5. Andrew Zisserman
  6. Marc Pollefeys
  7. Andrea Vedaldi
  8. Dacheng Tao

Citations in the corpus