Analysis of Two New Stereo Algorithms
Abstract
The authors present two algorithms for stereo matching that make use of simultaneous matching and surface reconstruction. By integrating matching and reconstruction, which are traditionally separated temporally, the algorithms can make use of the current surface approximation to help disambiguate the remaining matches. The result is a consistent smoothness assumption in both matching and surface reconstruction. The two methods differ in the surfaces reconstructed; one uses world surfaces and the other disparity surfaces. The authors present an initial experimental analysis of each algorithm and discuss the limitations of the approach and future work.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Boult and Chen. "Analysis of Two New Stereo Algorithms." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196233Markdown
[Boult and Chen. "Analysis of Two New Stereo Algorithms." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/boult1988cvpr-analysis/) doi:10.1109/CVPR.1988.196233BibTeX
@inproceedings{boult1988cvpr-analysis,
title = {{Analysis of Two New Stereo Algorithms}},
author = {Boult, Terrance E. and Chen, Liang-Hua},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1988},
pages = {177-182},
doi = {10.1109/CVPR.1988.196233},
url = {https://mlanthology.org/cvpr/1988/boult1988cvpr-analysis/}
}