Real-Time Motion Stereo
Abstract
A simple parallel algorithm for calculating depth from motion stereo is implemented. It makes the assumption that the incremental disparity is less than the minimum distance between edges. To relax this constraint, a more general multiscale pyramidal algorithm is developed. The two algorithms are tested on the Simon Fraser University pyramidal vision machine for real-time computer vision applications. The total processing time is 50 ms/image for the simple algorithm and approximately 0.5 s/image for the multiscale algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Ens and Li. "Real-Time Motion Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.340999Markdown
[Ens and Li. "Real-Time Motion Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/ens1993cvpr-real/) doi:10.1109/CVPR.1993.340999BibTeX
@inproceedings{ens1993cvpr-real,
title = {{Real-Time Motion Stereo}},
author = {Ens, John and Li, Ze-Nian},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1993},
pages = {130-135},
doi = {10.1109/CVPR.1993.340999},
url = {https://mlanthology.org/cvpr/1993/ens1993cvpr-real/}
}