Název: The 3-Point Method: A Fast, Accurate and Robust Solution to Vanishing Point Estimation
Autoři: Saini, Vinod
Gade, Shripad
Prasad, Mritunjay
Chatterjee, Saurabh
Citace zdrojového dokumentu: WSCG 2013: Communication Papers Proceedings: 21st International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation withEUROGRAPHICS Association, p. 151-158.
Datum vydání: 2013
Nakladatel: Václav Skala - UNION Agency
Typ dokumentu: konferenční příspěvek
conferenceObject
URI: http://wscg.zcu.cz/WSCG2013/!_2013-WSCG-Communications-proceedings.pdf
http://hdl.handle.net/11025/10658
ISBN: 978-80-86943-75-6
Klíčová slova: mizející body;kalibrace kamery;metoda tří bodů
Klíčová slova v dalším jazyce: vanishing points;camera calibration;3-point method
Abstrakt: Vanishing points can provide information about the 3D world and hence are of great interest for machine vision applications. In this paper, we present a single point perspectivity based method for robust and accurate estimation of Vanishing Points (VPs). It utilizes location of 3 collinear points in image space and their distance ratio in the world frame for VP estimation. We present an algebraic derivation for the proposed 3-Point (3-P) method. It provides us a non-iterative, closed-form solution. The 3-P results are compared with ground truth of VP and it is shown to be accurate. Its robustness to point selection and image noise is proved through extensive simulations. Computational time requirement for 3-P method is shown to be much less than least squares based method. The 3-P method is extremely useful for accurate VP estimation in structured and well-defined environments.
Práva: © Václav Skala - UNION Agency
Vyskytuje se v kolekcích:WSCG 2013: Communication Papers Proceedings

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Saini.pdfPlný text2,01 MBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/10658

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.