A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation

Abstract EN

In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time.

We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity.

This algorithm can be divided into two steps: disparity map initialization and disparity map refinement.

In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation.

In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function.

Then the initial disparity map is obtained by loopy belief propagation.

In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method.

The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect.

Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.