2013
DOI: 10.1007/s11263-013-0643-y
|View full text |Cite
|
Sign up to set email alerts
|

Sampling Minimal Subsets with Large Spans for Robust Estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 29 publications
(9 citation statements)
references
References 29 publications
0
9
0
Order By: Relevance
“…The suggested optimization method relates on the gradients of the cost function rather than second derivatives, which limits its speed. Moreover, the cost function derivatives are very high in areas close to structures, so prior knowledge such as spatial continuity is necessary to produce good initializations (Tran et al (2014)).…”
Section: Guided Sampling Methods For Robust Model Fittingmentioning
confidence: 99%
“…The suggested optimization method relates on the gradients of the cost function rather than second derivatives, which limits its speed. Moreover, the cost function derivatives are very high in areas close to structures, so prior knowledge such as spatial continuity is necessary to produce good initializations (Tran et al (2014)).…”
Section: Guided Sampling Methods For Robust Model Fittingmentioning
confidence: 99%
“…Unfortunately, for multi-structure data, these methods usually fail to achieve one clean solution within a reasonable time budget. Note that all of Multi-GS [17], RCMSA [32,33] and Multi-GS-Oset [41]accelerate promising hypothesis generation by using information derived from residual sorting. These methods can effectively handle most multi-structure data.…”
Section: Related Workmentioning
confidence: 99%
“…Owing to the fact that drawing an all-inlier minimal random sample is insufficient to ensure a proper model hypothesis, a random sampling strategy with constraints and guidance can be adopted to accelerate and strengthen the RANSAC algorithm. In [53], a novel sampling strategy that aimed to draw allinlier minimal samples with large spans was proposed, and a theoretical reasoning was presented. It was found in [54] that the actual iterative number was significantly higher than the theoretically predicted value, which was caused by the incorrect assumption that a model computed from an uncontaminated minimal sample is consistent with all the real noisy inliers.…”
Section: B Unified Ransacmentioning
confidence: 99%
“…The truncated quadratic cost function in the M-estimator SAC (MSAC) [52] replaces the top-hat type of RANSAC. In the minimal subset sampling stage, a prior sampling constraint is incorporated to prevent the minimal subset from containing data points that are too close, according to the principle in [53] that a minimal subset with a large spatial extent is desirable. A model refinement step, namely, inner RANSAC with an iteration method in locally optimized RANSAC [54], is inserted into the algorithm whenever a new best model so far is found.…”
Section: B Unified Ransacmentioning
confidence: 99%
See 1 more Smart Citation