A Dynamic Programming Approach to Reconstructing Building Interiors
Abstract
A number of recent papers have investigated reconstruction under Manhattan world assumption, in which surfaces in the world are assumed to be aligned with one of three dominant directions [1,2,3,4]. In this paper we present a dynamic programming solution to the reconstruction problem for “indoor” Manhattan worlds (a sub–class of Manhattan worlds). Our algorithm deterministically finds the global optimum and exhibits computational complexity linear in both model complexity and image size. This is an important improvement over previous methods that were either approximate [3] or exponential in model complexity [4]. We present results for a new dataset containing several hundred manually annotated images, which are released in conjunction with this paper.
Cite
Text
Flint et al. "A Dynamic Programming Approach to Reconstructing Building Interiors." European Conference on Computer Vision, 2010. doi:10.1007/978-3-642-15555-0_29Markdown
[Flint et al. "A Dynamic Programming Approach to Reconstructing Building Interiors." European Conference on Computer Vision, 2010.](https://mlanthology.org/eccv/2010/flint2010eccv-dynamic/) doi:10.1007/978-3-642-15555-0_29BibTeX
@inproceedings{flint2010eccv-dynamic,
title = {{A Dynamic Programming Approach to Reconstructing Building Interiors}},
author = {Flint, Alex and Mei, Christopher and Murray, David William and Reid, Ian D.},
booktitle = {European Conference on Computer Vision},
year = {2010},
pages = {394-407},
doi = {10.1007/978-3-642-15555-0_29},
url = {https://mlanthology.org/eccv/2010/flint2010eccv-dynamic/}
}