The Non-Tightness of a Convex Relaxation to Rotation Recovery
We study the Perspective-n-Point (PNP) problem, which is fundamental in 3D vision, for the recovery of camera translation and rotation. A common solution applies polynomial sum-of-squares (SOS) relaxation techniques via semidefinite programming. Our main result is that the polynomials which should b...
Guardado en:
Autores principales: | Yuval Alfassi, Daniel Keren, Bruce Reznick |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/353ad83b7f274009993f941f259ee0bc |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Strongly convexity on fractal sets and some inequalities
por: Sánchez C.,Rainier V., et al.
Publicado: (2020) -
Algorithm for the generalized Φ-strongly monotone mappings and application to the generalized convex optimization problem
por: Aibinu,M. O., et al.
Publicado: (2019) -
Multiobjective Convex Optimization in Real Banach Space
por: Kin Keung Lai, et al.
Publicado: (2021) -
Optimality Conditions and Duality for a Class of Generalized Convex Interval-Valued Optimization Problems
por: Yating Guo, et al.
Publicado: (2021) -
Experimental and numerical research of stress relaxation behavior of magnetorheological elastomer
por: Tran Huu Nam, et al.
Publicado: (2021)