signature=66b88eb63dc720d781ea23d69b9d77b4,\\uc2a4\\ud2b8\\ub9ac\\ud0b9 \\ud604\\uc0c1\\uc744 \\uac1...

摘要：

- . , . . , . Middlebury 6.33% 29 . .

The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.

展开