Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Real-Time Stereo by using Dynamic Programming
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 3 - Volume 03
High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Image synthesis and occlusion removal of intermediate views by stereo matching
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
As a step towards real-time stereo on 2D markov random field (MRF), we will present fast belief propagation (FBP) VLSI architecture for stereo matching, which has a parallel, distributed and memory-efficient structure and lowest error rates among the real-time systems. FBP can reduce memory complexities by 17 times smaller than belief propagation (BP) and output 320x240 disparity image of 32 levels with 320 parallel processors on 2 Xilinx FPGAs at 30 frames/s. Multiple chips can be cascaded to increase computation speed due to its linear array architecture. Our structure is more adequate for high resolution and real-time applications like 3D video conference, multi-view coding and 3D modelling.