CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences

DOI10.1007/s10851-022-01133-8arXiv1907.10545OpenAlexW2963352393MaRDI QIDQ6098357

No author found.

Publication date: 13 June 2023

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationsemidefinite relaxationabsolute pose estimationpoint and line correspondences

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Conic optimization via operator splitting and homogeneous self-dual embedding
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Non-Iterative Rigid 2D/3D Point-Set Registration Using Semidefinite Programming
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences