An Evaluation of Two Automatic Landmark Building Discovery Algorithms for City Reconstruction
Abstract
An important part of large-scale city reconstruction systems is an image clustering algorithm that divides a set of images into groups that should cover only one building each. Those groups then serve as input for structure from motion systems. A variety of approaches for this mining step have been proposed recently, but there is a lack of comparative evaluations and realistic benchmarks. In this work, we want to fill this gap by comparing two state-of-the-art landmark mining algorithms: spectral clustering and min-hash. Furthermore, we introduce a new large-scale dataset for the evaluation of landmark mining algorithms consisting of 500k images from the inner city of Paris. We evaluate both algorithms on the well-known Oxford dataset and our Paris dataset and give a detailed comparison of the clustering quality and computation time of the algorithms.
Cite
Text
Weyand et al. "An Evaluation of Two Automatic Landmark Building Discovery Algorithms for City Reconstruction." European Conference on Computer Vision, 2010. doi:10.1007/978-3-642-35740-4_24Markdown
[Weyand et al. "An Evaluation of Two Automatic Landmark Building Discovery Algorithms for City Reconstruction." European Conference on Computer Vision, 2010.](https://mlanthology.org/eccv/2010/weyand2010eccv-evaluation/) doi:10.1007/978-3-642-35740-4_24BibTeX
@inproceedings{weyand2010eccv-evaluation,
title = {{An Evaluation of Two Automatic Landmark Building Discovery Algorithms for City Reconstruction}},
author = {Weyand, Tobias and Hosang, Jan Hendrik and Leibe, Bastian},
booktitle = {European Conference on Computer Vision},
year = {2010},
pages = {310-323},
doi = {10.1007/978-3-642-35740-4_24},
url = {https://mlanthology.org/eccv/2010/weyand2010eccv-evaluation/}
}