Matching Cost Filtering for Dense Stereo Correspondence

Abstract EN

Dense stereo correspondence enabling reconstruction of depth information in a scene is of great importance in the field of computer vision.

Recently, some local solutions based on matching cost filtering with an edge-preserving filter have been proved to be capable of achieving more accuracy than global approaches.

Unfortunately, the computational complexity of these algorithms is quadratically related to the window size used to aggregate the matching costs.

The recent trend has been to pursue higher accuracy with greater efficiency in execution.

Therefore, this paper proposes a new cost-aggregation module to compute the matching responses for all the image pixels at a set of sampling points generated by a hierarchical clustering algorithm.

The complexity of this implementation is linear both in the number of image pixels and the number of clusters.

Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art local methods in terms of both accuracy and speed.

Moreover, performance tests indicate that parameters such as the height of the hierarchical binary tree and the spatial and range standard deviations have a significant influence on time consumption and the accuracy of disparity maps.