A fast and parallel belief computation structure for stereo matching

Authors:
Sungchan Park;Hong Jeong
Affiliations:
Pohang University of Science and Technology, Pohang, Kyungbuk, South Korea;Pohang University of Science and Technology, Pohang, Kyungbuk, South Korea
Venue:
EurolMSA '07 Proceedings of the Third IASTED European Conference on Internet and Multimedia Systems and Applications
Year:
2007

Citing 4
Cited 1

A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

International Journal of Computer Vision
A Stereo Machine for Video-Rate Dense Depth Mapping and Its New Applications

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
The Use of Dense Stereo Range Data in Augmented Reality

ISMAR '02 Proceedings of the 1st International Symposium on Mixed and Augmented Reality
Improvements in Real-Time Correlation-Based Stereo Vision

SMBV '01 Proceedings of the IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV'01)

Real-Time Stereo Matching Using Memory-Efficient Belief Propagation for High-Definition 3D Tele-Presence Systems

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The stereo matching algorithm based on the belief propagation (BP) has the low matching error as the global method, but has the disadvantage of a long processing time. In addition to a low error in the Middlebury image simulation, a new architecture based on BP shows a high-speed parallel VLSI structure of the time complexity O(N), at properly small iterations, so that it can be useful as a chip in the real-time application like the 3D video conference, the Z-keying, and the virtual reality.