Fast Stereovision with Subpixel-Precision
Abstract
A fast stereo algorithm based on aliasing effects of simple disparity estimators within a coherence detection scheme is presented. The algorithm calculates dense disparity maps with subpixel-precision by performing local spatial filter operations and simple arithmetic transformations. Performance similar to classical area-based approaches is achieved, but without the complicated hierarchical search structure typical for these approaches. The algorithm is completely parallel; the disparity valves are calculated independently for each pixel. In addition, local validation counts for the disparity estimates and a fused cyclopean view of the scene are available within the proposed network structure for coherence-based stereo.
Cite
Text
Henkel. "Fast Stereovision with Subpixel-Precision." IEEE/CVF International Conference on Computer Vision, 1998. doi:10.1109/ICCV.1998.710842Markdown
[Henkel. "Fast Stereovision with Subpixel-Precision." IEEE/CVF International Conference on Computer Vision, 1998.](https://mlanthology.org/iccv/1998/henkel1998iccv-fast/) doi:10.1109/ICCV.1998.710842BibTeX
@inproceedings{henkel1998iccv-fast,
title = {{Fast Stereovision with Subpixel-Precision}},
author = {Henkel, Rolf D.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1998},
pages = {1024-1028},
doi = {10.1109/ICCV.1998.710842},
url = {https://mlanthology.org/iccv/1998/henkel1998iccv-fast/}
}