Monocular Pose Determination from Lines: Critical Sets and Maximum Number of Solutions
Abstract
A subpart of the following problem is considered. It is assumed that a set of known three-dimensional lines with an unknown pose and orientation are observed with a camera. The problem is to recover the position and orientation of the camera from the observed image lines, assuming that a correspondence has been established between the 2-D and the 3-D lines. It is shown that there exist infinite sets of three-dimensional lines such that no matter how many lines are observed in these sets the solution to the orientation or pose determination problem is not unique. The maximum number of possible solutions is given. These results clearly define the domain of validity of algorithms which solve the orientation or pose determination problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Navab and Faugeras. "Monocular Pose Determination from Lines: Critical Sets and Maximum Number of Solutions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.340981Markdown
[Navab and Faugeras. "Monocular Pose Determination from Lines: Critical Sets and Maximum Number of Solutions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/navab1993cvpr-monocular/) doi:10.1109/CVPR.1993.340981BibTeX
@inproceedings{navab1993cvpr-monocular,
title = {{Monocular Pose Determination from Lines: Critical Sets and Maximum Number of Solutions}},
author = {Navab, Nassir and Faugeras, Olivier D.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1993},
pages = {254-260},
doi = {10.1109/CVPR.1993.340981},
url = {https://mlanthology.org/cvpr/1993/navab1993cvpr-monocular/}
}