A Region-Based Stereo Algorithm
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Vision and Robotics. Pages 1661-1667.
Abstract
Feature-point-based stereo and segment-based s • ~reo have been intensively studied. But why not region-based stereo? Region is more characteristic than point and segment. Matching between regions is easier ar..d faster, if region segmentation is successful. Unfortunately, however, it is the failure to satisfy this precondition that has been the obstacle. Region segmentation in practice is subtle and unstable, and it is not guaranteed that region boundaries in stereo images correspond to same physical positions. Our approach to tackling this problem is to sharpen intensity contrast between regions by projecting a random pattern to the visual field. The proposed algorithm has been implemented to match both computer-generated random pattern stereo images and pattern-projected real images. Results show that the algorithm is robust, fast and tolerant of small vertical disparities.
@inproceedings{ijcai1989p264,
title = {A Region-Based Stereo Algorithm},
author = {Xu, Gang and Kondo, Hideki and Tsuji, Saburo},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {1661--1667},
year = {1989},
month = {8},
note = {Vision and Robotics},
url = {https://ijcai.org/proceedings/1989/264},
}
TY - CPAPER TI - A Region-Based Stereo Algorithm AU - Xu, Gang AU - Kondo, Hideki AU - Tsuji, Saburo T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 1661 EP - 1667 UR - https://ijcai.org/proceedings/1989/264 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
