Fast weighted cost propagation with smoothness constraint on a tree
In this paper, we propose a novel fast cost propagation algorithm on spanning tree structures. By introducing local smoothness constraint during the weighted cost aggregation process on tree structures, we overcome the shortage of the “fronto-parallel plane” assumption used in most local and non-local cost aggregation algorithms. By applying it to our stereo correspondence framework, accurate results with fine disparity boundaries can be obtained. We also introduce a linear time implementation of the proposed algorithm, thus the computational complexity is kept extremely low.