ML Anthology

Interactive Complexity Control and High-Speed Stereo Matching

Gruia-Catalin Roman, Andrew F. Laine, Kenneth C. Cox
CVPR 1988 pp. 171-176
doi:10.1109/CVPR.1988.196232 /cvpr/1988/roman1988cvpr-interactive/

Abstract

The authors are concerned with the development of a novel approach to edge-based stereo matching. In the context of an incremental matching strategy the authors have replaced the traditional hierarchical (coarse-fine) matching by an approach called complexity control based matching. The implementation of this method allows the user to select interactively features which (given the context provided by previous matches) are most likely to be matched successfully. The selection is done at the resolution of the original image and utilizes a rich set of feature properties (e.g. edge strength, orientation, length, texture etc.), either alone or in logical combinations. Both feature-selection and feature-matching algorithms execute at real-time rates, and all interactions are via a stereo workstation.

PDF CVPR Semantic Scholar

Cite

Text

Roman et al. "Interactive Complexity Control and High-Speed Stereo Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196232

Markdown

[Roman et al. "Interactive Complexity Control and High-Speed Stereo Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/roman1988cvpr-interactive/) doi:10.1109/CVPR.1988.196232

BibTeX

@inproceedings{roman1988cvpr-interactive,
  title     = {{Interactive Complexity Control and High-Speed Stereo Matching}},
  author    = {Roman, Gruia-Catalin and Laine, Andrew F. and Cox, Kenneth C.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1988},
  pages     = {171-176},
  doi       = {10.1109/CVPR.1988.196232},
  url       = {https://mlanthology.org/cvpr/1988/roman1988cvpr-interactive/}
}