| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 102 === In this paper, we propose a new method for stereo matching. In our approach, the reference image is divided into non-overlapping homogeneous segments by Mean-Shift segmentation algorithm. We apply local stereo matching methods and Delaunay triangular on feature points to generate a set of disparity plane for the scene, and each segment is represented as a plane in the disparity space. The stereo matching problem is formulated as a segment-domain energy minimization problem rather than the traditional pixel-domain in our method. The graph cut technique is used to efficiently approximate the optimal solution for energy function in recent years. Our optimization strategy is to apply the disparity plane alpha-expansion, based on “QPBO” algorithm. Therefore we propose an innovative method to approximately encode occlusion consideration into QPBO, based on a dynamic z-buffer constructed by the disparity of the warping pixels in the reference image. We evaluate our algorithm using the cases in the website “Middlebury”, and the results show that the average of bad pixels is about 10%.
|
|---|
