FPGA implementation of a stereo matching processor based on window-parallel-and-pixel-parallel architecture

This paper presents a processor architecture for high-speed and reliable stereo matching based on adaptive window-size control of SAD (sum of absolute differences) computation. To reduce its computational complexity, SADs are computed using images divided into nonoverlapping regions, and the matching result is iteratively refined by reducing a window size. Window-parallel-and-pixel-parallel architecture is also proposed to achieve to fully exploit the potential parallelism of the algorithm. The architecture also reduces the complexity of an interconnection network between memory and functional units based on the regularity of reference pixels. The stereo matching processor is implemented on an FPGA. Its performance is 80 times higher than that of a microprocessor (Pentium4@2GHz), and is enough to generate a 3D depth image at the video rate of 33MHz

[1]  Avinash C. Kak,et al.  Stereo vision , 1994 .

[2]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Richard Szeliski,et al.  Stereo matching with non-linear diffusion , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  Masanori Hariyama,et al.  VLSI processor for reliable stereo matching based on adaptive window-size selection , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[5]  M. Kameyama,et al.  VLSI processor for reliable stereo matching based on window-parallel logic-in-memory architecture , 2004, 2004 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No.04CH37525).