.png){kind=icon}
返回
Tractable Algorithms for Robust Model Estimation
.png){kind=icon}
PRE
AI
DOI：10.1007/s11263-014-0760-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
What is the computational complexity of geometric model estimation in the presence of noise and outliers? We show that the number of outliers can be minimized in polynomial time with respect to the number of measurements, although exponential in the model dimension. Moreover, for a large class of problems, we prove that the statistically more desirable truncated -norm can be optimized with the same complexity. In a similar vein, it is also shown how to transform a multi-model estimation problem into a purely combinatorial one-with worst-case complexity that is polynomial in the number of measurements but exponential in the number of models. We apply our framework to a series of hard fitting problems. It gives a practical method for simultaneously dealing with measurement noise and large amounts of outliers in the estimation of low-dimensional models. Experimental results and a comparison to random sampling techniques are presented for the applications rigid registration, triangulation and stitching.
Keyword:
Outliers
Geometry
Optimization
3D reconstruction
Image registration
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.3
论文数:
3.9K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY随机样本共识-模型拟合的范例，可应用于图像分析和自动制图
OAAI
OAAI分享收藏Fast and Stable Polynomial Equation Solving and Its Application to Computer Vision快速稳定的多项式方程求解及其在计算机视觉中的应用
PREAI
分享收藏
查看更多内容