Sampling minimal subsets with large spans for robust estimation

DOI10.1007/S11263-013-0643-YzbMATH Open1328.68251OpenAlexW2005695642MaRDI QIDQ903434FDOQ903434

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

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.

zbMATH Keywords

least squarestotal least squaresrobust fittinghypothesis samplingminimal subsets

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Analysis of the Total Least Squares Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple View Geometry in Computer Vision
• Algebraic connections between the least squares and total least squares problems
• A generalization of the Eckart-Young-Mirsky matrix approximation theorem
• Consistent fundamental matrix estimation in a quadratic measurement error model arising in motion analysis

Cited In (2)

• Title not available (Why is that?)
• Robust fitting in computer vision: easy or hard?

Uses Software

• VanHuffel
• Vlfeat
• SIFT
• MLESAC
• NAPSAC

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)