@InProceedings{Schilling-OAGM-2013, IS = { zkontrolovano 29 Mar 2015 }, UPDATE = { 2015-03-29 }, author = {Schilling, Tanja and Pajdla, Tomas}, title = {Euclidean Upgrade from a Minimal Number of Segments}, year = {2013}, pages = {1-9}, booktitle = {Proceedings of the OAGM/AAPR 2013-The 37th Annual Workshop of the Austrian Association for Pattern Recognition}, editor = {Piater, Justus and Rodriguez Sanchez, Antonio J.}, publisher = {Austrian Association for Pattern Recognition}, address = {JOANNEUM RESEARCH, Forschungsgesellschaft mbH, Steyrergasse 17, 8010 Graz, Austria}, isbn = {}, volume = {}, series = {}, number = {}, book_pages = {}, month = {May}, day = {23-24}, venue = {Innsbruck, Austria}, annote = {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{\" o}bner 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 = {Minimal Number of Segments; Euclidean Upgrade}, prestige = {international}, project = {FP7-SPACE-2012-312377}, authorship = {50-50}, }