A hybrid algorithm for disparity calculation from sparse disparity estimates based on stereo vision
This incremental improvement addresses disparity calculation for stereo vision applications, such as robotics or 3D reconstruction.
The paper tackles stereo disparity estimation by combining block-based and region-based matching to generate dense disparity maps from only 18% of pixel measurements, achieving up to 30% improvement over traditional methods and 2.6% over a recent approach on the Middlebury dataset.
In this paper, we have proposed a novel method for stereo disparity estimation by combining the existing methods of block based and region based stereo matching. Our method can generate dense disparity maps from disparity measurements of only 18% pixels of either the left or the right image of a stereo image pair. It works by segmenting the lightness values of image pixels using a fast implementation of K-Means clustering. It then refines those segment boundaries by morphological filtering and connected components analysis, thus removing a lot of redundant boundary pixels. This is followed by determining the boundaries' disparities by the SAD cost function. Lastly, we reconstruct the entire disparity map of the scene from the boundaries' disparities through disparity propagation along the scan lines and disparity prediction of regions of uncertainty by considering disparities of the neighboring regions. Experimental results on the Middlebury stereo vision dataset demonstrate that the proposed method outperforms traditional disparity determination methods like SAD and NCC by up to 30% and achieves an improvement of 2.6% when compared to a recent approach based on absolute difference (AD) cost function for disparity calculations [1].