Algorithms for vanishing point detection

Algorithms for vanishing point detection

On this page you'll find the source code and data used for evaluation for the algorithms described in the paper "Vanishing Point Detection with an Intersection Point Neighborhood" which will be presented in the conference  "15th International Conference on Discrete Geometry for Computer Imagery",  September 30 - October 2, 2009 Montréal (QC) Canada.

At the moment we make available the algorithms source code and instructions for building the sources under Linux using the CMake build system. Building under MS Windows is possible as well, if you have any troubles with that, please contact us or use the binaries provided below.

The sources can be found at www.uni-koblenz.de/~lb/lb_downloads/vpointssource.tar.bz2 in the archive is a file Readme.txt containing detailed instructions on building and usage of the application. Precompiled binaries for MS Windows including a graphical user interface (VpGui.exe, needs .NET) can be found at www.uni-koblenz.de/~lb/lb_downloads/vpoints-win.zip.

The images used for evaluation of the algorithm as well as the manual segmentation can be found at www.uni-koblenz.de/~lb/lb_downloads/vpointstestdata.tar.bz2. You have to adapt the paths in xml/img2xml.txt to your system before doing automatic evaluations.