Robust fitting in computer vision: easy or hard?

DOI10.1007/s11263-019-01207-yzbMath1477.68344arXiv1802.06464OpenAlexW2788127582WikidataQ127392246 ScholiaQ127392246MaRDI QIDQ2193856

Yanyan Li

Publication date: 20 August 2020

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

Full work available at URL: https://arxiv.org/abs/1802.06464

zbMATH Keywords

robust fittingcomputational hardnessconsensus maximisationinlier set maximisation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Machine vision and scene understanding (68T45) Robustness in mathematical programming (90C17)

Related Items (1)

A Framework of Learning Through Empirical Gain Maximization

Uses Software

• Vlfeat
• KITTI
• USAC

Cites Work

• Unnamed Item
• On the least median square problem
• Sampling minimal subsets with large spans for robust estimation
• Approximation algorithms for combinatorial problems
• The densest hemisphere problem
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• The computational complexity of densest region detection
• Tractable algorithms for robust model estimation
• On geometric optimization with few violated constraints
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• On Approximating the Depth and Related Problems
• The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
• Parameterized Algorithms

This page was built for publication: Robust fitting in computer vision: easy or hard?