Disparity Map Computation from Stereo Images Using Hill-Climbing Segmentation

DOI®: doi.org/10.21276/ijre.2019.6.1.1

CITATION: San, T., & Win, K. (2019). Disparity Map Computation from Stereo Images Using Hill-Climbing Segmentation. International Journal Of Research And Engineering, 6(1), 547-555. doi:10.21276/ijre.2019.6.1.1

Author(s): 1Tin Tin San, 2Kay Thi Win

Affiliation(s)1Image Processing Lab, University of Computer Studies, Mandalay, Myanmar,2Faculty of Information Science, University of Computer Studies, Mandalay, Myanmar

Abstract: Stereo matching is one of the most active research areas in computer vision for decades. The task of stereo matching is to find the point correspondence between two images of the same scene taken from different viewpoints. This paper presents a segment-based stereo matching algorithm. Firstly, the reference image is segmented using hill-climbing algorithm and local stereo matching is performed Scale Invariant Feature Transform (SIFT) feature points with Sum of Absolute Differences (SAD) block matching. Secondly, a set of reliable pixels is constructed by comparing the matching cost and the mutual cross-checking consistent between the left and right initial disparity maps, which can lead to an actual disparity plane. Thirdly, a set of all possible disparity planes are extracted and then plane fitting and neighboring segment merging are performed. Finally, the disparity planes are set in each region using graph cuts to obtain final disparity map. The evaluation of proposed algorithm on the Middlebury data set result shows that the proposed algorithm is competitive with state-of-the-art stereo matching algorithms.  

Full Article – PDF

Public Knowledge Project [ INDEXED LINK at index.pkp.sfu.ca ]

Academia.edu [ INDEXED LINK at www.academia.edu ]

Zenodo Research Platform [ INDEXED LINK at zenodo.org ]

Indexed by other automated sites of Open Journal System under Public Knowledge Project http://pkp.sfu.ca/ojs

  • 1.4K