Journal of the Institute of Electronics Engineers of Korea SD (대한전자공학회논문지SD)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

MOEPE: Merged Odd-Even PE Architecture for Stereo Matching Hardware

MOEPE: 스테레오 정합 하드웨어를 위한 Merged Odd-Even PE구조

  • Han, Phil-Woo (Korea Axis Co., LTD R&D center) ;
  • Yang, Yeong-Yil (GyeongSang National University, Division of Electric and Electronics Engineering)
  • 한필우 ((주)한국엑시스 技術硏究所) ;
  • 양영일 (慶尙大學校 電氣電子工學部)
  • Published : 2000.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamprogrammethod. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities form the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the same number of the range constraint, which reduced the nuMber of the necessary PEs draMatically compared to the traditional method which uses the PEs with the same number of pixels on the epipolar line. For the normal sized images, the numof the MOEPE architecture is less than that of the PEs in the traditional method by 25${\times}$The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

본 논문에서는 동적 프로그래밍에 기반한 스테레오 정합 알고리듬을 구현하는 새로운 하드웨어 구조를 제안하였다. 제안된 MOEPE(Merged Odd-Even PE) 구조는 시스톨릭 방법으로 동작하고, 극상선상의 화소의 밝기 값으로부터 변이를 찾는다. MOEPE구조에서 사용된 PE 수는 변이제약조건의 수와 일치하는데, 이는 극상선상의 화소 수만큼의 PE를 사용하는 기존의 방법에 비하여 훨씬 적은 수의 PE를 사용한다. MOEPE 구조에서 사용된 PE 수는 일반적 크기의 영상에 대하여, 기존의 방법에 비하여 약 25배 적은 수의 PE를 사용한다. 제안된 구조는 VHDL로 기술하였고, Synopsys 설계 환경에서 시뮬레이션을 수행하였다.

Keywords

References

  1. R. C. Jain and A. K. Jain, 'Review of the NSF Range Sensing Workshop,' Computer Vision and Pattern Recognition Conf., Ann Arbor, MI, May 1988
  2. R. C. Gonzalez and R. E. Woods, Digital Image Processing, Addison Wesley, pp. 68-71, 1993
  3. D. Marr and T. Poggio, 'Cooperative computation of stereo disparity,' Science, Vol. 194, pp. 283-287, 1976 https://doi.org/10.1126/science.968482
  4. Y. S. Sim and S. H. Park 'A Study on the Feature Points Detection for Stereo Matching,' Journal of Research Institute of Industrial Sciences, Vol. 30, pp. 27-33, 1990
  5. N. M. Nasrabadi and C. Y. Choo, 'Hopfield network for stereo vision correspondence,' IEEE Trans. on Neural Networks, Vol. 3, No. 1, Jan. 1992 https://doi.org/10.1109/72.105413
  6. Takeo Kanade, Masatoshi Okutomi, 'A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment,' IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 16, no. 9, Sept, 1994 https://doi.org/10.1109/34.310690
  7. Y. Ohta and T. Kanade, 'Stereo by intra-and inter-scanline search using dynamic programming,' IEEE Trans. Pattern Anal. Machine Intell., Vol. 7, No. 2, pp. 139-154, 1985
  8. C. Guerra and T. Kanade, 'A Systolic Algorithm for Stereo Matching,' Proc. of International Workshop on Parallel Computing and VLSI, Amalfi, Italy, May 1984
  9. I. J. Cox, S. L. Hingorani and S. B. Rao, 'A Maximum likelihood stereo algorithm,' Computer Vision and Image Understanding, Vol. 63, No. 3, pp. 542-567, May 1996 https://doi.org/10.1006/cviu.1996.0040
  10. N. Weste and D. J. Burr, 'Dynamic Time Warp Pattern Matching Using an Integrated Multiprocessing Array,' IEEE Trans. on Computers, Vol. c-32, No. 8, 1983