\(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm

DOI10.1007/S11263-014-0791-8zbMath1398.68606OpenAlexW2126471207MaRDI QIDQ1799963

Khurrum Aftab, Jochen Trumpf, Richard I. Hartley

Publication date: 19 October 2018

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

Full work available at URL: https://doi.org/10.1007/s11263-014-0791-8

zbMATH Keywords

triangulationaffine subspaces\(L_q\) mean\(L_q\) Weiszfeld algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

On the tightness of semidefinite relaxations for rotation estimation ⋮ Rotation averaging ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm

Uses Software

• SBA
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rotation averaging
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• A note on convergence in the single facility minisum location problem
• \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm
• Solving a Generalized Heron Problem by Means of Convex Analysis
• SBA
• Riemannian median and its estimation
• Schubert Calculus
• Iteratively reweighted least squares minimization for sparse recovery
• Weber's problem and weiszfeld's algorithm in general spaces
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Multiple View Geometry in Computer Vision
• Further notes on convergence of the Weiszfeld algorithm
• Robust Recovery of Signals From a Structured Union of Subspaces
• A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization

This page was built for publication: \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm