Sampling minimal subsets with large spans for robust estimation

DOI10.1007/s11263-013-0643-yzbMath1328.68251OpenAlexW2005695642MaRDI QIDQ903434

David Suter, Quoc Huy Tran, Tat-Jun Chin, Wojciech Chojnacki

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)

Related Items (1)

Robust fitting in computer vision: easy or hard?

Uses Software

• VanHuffel
• Vlfeat
• SIFT
• MLESAC
• NAPSAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Analysis of the Total Least Squares Problem
• A generalization of the Eckart-Young-Mirsky matrix approximation theorem
• Algebraic connections between the least squares and total least squares problems
• Consistent fundamental matrix estimation in a quadratic measurement error model arising in motion analysis
• Multiple View Geometry in Computer Vision

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