A stereo matching algorithm in pixel-based disparity space image 


Vol. 29,  No. 6, pp. 848-856, Jun.  2004


PDF
  Abstract

In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and get a good quality disparity map in very short time.

  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]

C. Kim, H. Lee, Y. Ha, "A stereo matching algorithm in pixel-based disparity space image," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 848-856, 2004. DOI: .

[ACM Style]

Cheol-Hwan Kim, Ho-Keun Lee, and Yeong-Ho Ha. 2004. A stereo matching algorithm in pixel-based disparity space image. The Journal of Korean Institute of Communications and Information Sciences, 29, 6, (2004), 848-856. DOI: .

[KICS Style]

Cheol-Hwan Kim, Ho-Keun Lee, Yeong-Ho Ha, "A stereo matching algorithm in pixel-based disparity space image," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 848-856, 6. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880