2021
DOI: 10.1109/tpami.2021.3071812
|View full text |Cite
|
Sign up to set email alerts
|

Graph-Cut RANSAC: Local Optimization on Spatially Coherent Structures

Abstract: We propose Graph-Cut RANSAC, GC-RANSAC in short, a new robust geometric model estimation method where the local optimization step is formulated as energy minimization with binary labeling, applying the graph-cut algorithm to select inliers. The minimized energy reflects the assumption that geometric data often form spatially coherent structures -it includes both a unary component representing point-to-model residuals and a binary term promoting spatially coherent inlier-outlier labelling of neighboring points.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(18 citation statements)
references
References 58 publications
0
18
0
Order By: Relevance
“…We computed the average processing times of the solvers over 1,000 random problem instances. The solvers were implemented in C++ within the GC-RANSAC [5] framework using the Eigen library for performing matrix operations. We used the 5pt [38] and P3P [44] methods implemented in GC-RANSAC for composing the discussed solvers.…”
Section: Mean-point Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…We computed the average processing times of the solvers over 1,000 random problem instances. The solvers were implemented in C++ within the GC-RANSAC [5] framework using the Eigen library for performing matrix operations. We used the 5pt [38] and P3P [44] methods implemented in GC-RANSAC for composing the discussed solvers.…”
Section: Mean-point Strategymentioning
confidence: 99%
“…To estimate the relative poses between the images of each triplet, we apply the Graph-Cut RANSAC [5] robust estimator. The point-to-model residual function is chosen to be the Sampson error of a triplet correspondence average over image pairs 1-2 and 1-3.…”
Section: Mean-point Strategymentioning
confidence: 99%
“…The authors test its adequacy to several computer vision problems with synthetic and real data and claim it to be more geometrically accurate and at the same time easy to implement. Additional improvements have been presented in [ 43 , 44 ], where USAC [ 45 ] and MAGSAC++ [ 46 ] robust estimators are included in the algorithm.…”
Section: Ransac Variantsmentioning
confidence: 99%
“…A 3D plane instance is reconstructed by fitting a set of sparse and noisy 3D points triangulated in real-time, which is initialized by the instance planar segmentation using [46] (only on keyframes). However, in order to cope with possible misclassification from the neural network, especially on the unseen dataset of SLAM benchmarks, the reconstruction is conducted as a sequential RANSAC [38] coupled with an inner local optimization of Graph-cut [1]. In this way, we locally optimize the spatial coherent planes in 3D space, as explained by Fig.…”
Section: Pl üCker Coordinates and Orthonormal Representationmentioning
confidence: 99%