Sampling minimal subsets with large spans for robust estimation

DOI10.1007/S11263-013-0643-YMaRDI QIDQ903434zbMATH OpenOpenAlexFDO

Authors Quoc Huy Tran, Tat-Jun Chin, Wojciech Chojnacki, D. Suter

Publication date 6 January 2016

Published in International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11263-013-0643-y

zbMATH Keywords

least squarestotal least squaresrobust fittinghypothesis samplingminimal subsets

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Machine vision and scene understanding (68T45)

Recommendations

• Robust Parameter Estimation in Computer Vision
• Robust estimation of location and scatter by pruning the minimum spanning tree
• scientific article; zbMATH DE number 2044083
• Robust estimation for an inverse problem arising in multiview geometry
• Robust estimation based on energy minimization principles.

Cites work

• scientific article; zbMATH DE number 4072104 (Why is no real title available?)
• scientific article; zbMATH DE number 194744 (Why is no real title available?)
• scientific article; zbMATH DE number 942877 (Why is no real title available?)
• A generalization of the Eckart-Young-Mirsky matrix approximation theorem
• Algebraic connections between the least squares and total least squares problems
• An Analysis of the Total Least Squares Problem
• Consistent fundamental matrix estimation in a quadratic measurement error model arising in motion analysis
• Multiple View Geometry in Computer Vision

Cited in

(2)

• scientific article; zbMATH DE number 2044083 (Why is no real title available?)
• Robust fitting in computer vision: easy or hard?

Describes a project that uses

Uses Software

• NAPSAC
• MLESAC
• SIFT
• Vlfeat
• VanHuffel

This page was built for publication: Sampling minimal subsets with large spans for robust estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903434)