Multi-View Stereo Revisited
Abstract
We present an extremely simple yet robust multi-view stereo algorithm and analyze its properties. The algorithm first computes individual depth maps using a window-based voting approach that returns only good matches. The depth maps are then merged into a single mesh using a straightforward volumetric approach. We show results for several datasets, showing accuracy comparable to the best of the current state of the art techniques and rivaling more complex algorithms.
Cite
Text
Goesele et al. "Multi-View Stereo Revisited." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006. doi:10.1109/CVPR.2006.199Markdown
[Goesele et al. "Multi-View Stereo Revisited." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006.](https://mlanthology.org/cvpr/2006/goesele2006cvpr-multi/) doi:10.1109/CVPR.2006.199BibTeX
@inproceedings{goesele2006cvpr-multi,
title = {{Multi-View Stereo Revisited}},
author = {Goesele, Michael and Curless, Brian and Seitz, Steven M.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2006},
pages = {2402-2409},
doi = {10.1109/CVPR.2006.199},
url = {https://mlanthology.org/cvpr/2006/goesele2006cvpr-multi/}
}