전자공학회논문지S (Journal of the Korean Institute of Telematics and Electronics S)
- 제36S권10호
- /
- Pages.123-131
- /
- 1999
- /
- 1226-5837(pISSN)
에지 정보를 강조한 동적계획법에 의한 스테레오 정합
Stereo Matching by Dynamic Programming with Edges Emphasized
- Joo, Jae-Heum (Dept. of Computer Science, Jisan College) ;
- Oh, Jong-kyu (Dept. of Electronics Engineering, Pusan National University) ;
- Seol, Sung-Wook (Dept. of Electronics Engineering, Pusan National University) ;
- Lee, Chul-Hun (Dept. of Office Automation, Yangsan College) ;
- Nam, Ki-Gon (Dept. of Electronics Engineering, Pusan National University)
- 발행 : 1999.10.01
초록
본 논문에서는 에지를 강조하여 동적계획법을 적용한 스테레오 정합 알고리즘을 제안한다. 기존 알고리즘에서는 표면의 평활화 제약조건의 적용, 폐색 영역에서의 정합 화소 부재 등으로 인하여 대체로 불연속 지점에서의 무뎌짐 현상을 보이고 있다. 또한 밝기 변화가 없는 영역에서는 정합 정보 부족으로 인하여 정합 에러를 동반하게 된다. 본 논문에서는 좌
In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.
키워드