Dynamic Programming-based Stereo Matching Using Image Segmentation 


Vol. 35,  No. 8, pp. 680-688, Aug.  2010


PDF
  Abstract

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Seo and J. Yoo, "Dynamic Programming-based Stereo Matching Using Image Segmentation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 8, pp. 680-688, 2010. DOI: .

[ACM Style]

Yong-seok Seo and Ji-sang Yoo. 2010. Dynamic Programming-based Stereo Matching Using Image Segmentation. The Journal of Korean Institute of Communications and Information Sciences, 35, 8, (2010), 680-688. DOI: .

[KICS Style]

Yong-seok Seo and Ji-sang Yoo, "Dynamic Programming-based Stereo Matching Using Image Segmentation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 8, pp. 680-688, 8. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880