Stereo Correspondence Algorithm Using Dynamic programming

동적 계획법을 이용한 스테레오 대응 알고리즘

  • 이충환 (아주대학교 전자공학과) ;
  • 홍석교 (아주대학교 전자공학과)
  • Published : 2000.10.01

Abstract

The main problem in stereo vision is to find corresponding points in left and right image known as correspondence problem. Once correspondences determined, the depth information of those points are easily computed form the pairs of points in both image. In this paper, dynamic programming considering half-occluded region is used fer solving correspondence problem.

Keywords