Euclidean Upgrade from a Minimal Number of Segments
Computer Vision and Pattern Recognition
2013-04-26 v1
Abstract
In this paper, we propose an algebraic approach to upgrade a projective reconstruction to a Euclidean one, and aim at computing the rectifying homography from a minimal number of 9 segments of known length. Constraints are derived from these segments which yield a set of polynomial equations that we solve by means of Gr\"obner bases. We explain how a solver for such a system of equations can be constructed from simplified template data. Moreover, we present experiments that demonstrate that the given problem can be solved in this way.
Keywords
Cite
@article{arxiv.1304.6990,
title = {Euclidean Upgrade from a Minimal Number of Segments},
author = {Tanja Schilling and Tomas Pajdla},
journal= {arXiv preprint arXiv:1304.6990},
year = {2013}
}
Comments
Part of the OAGM/AAPR 2013 proceedings (arXiv:1304.1876)