A novel region-based progressive stereo matching algorithm is presented. It combines the strengths of previous region-based and progressive approaches. The progressive framework avoids the time consuming global optimization, while the inherent problem, the sensitivity to early wrong decisions, is significantly alleviated via the region-based representation. A growing-like process matches the regions progressively using a global best-first strategy based on a cost function integrating disparity smoothness and visibility constraint. The performance on standard evaluation platform using various real images shows that the algorithm is among the state-of-the-art both in accuracy and efficiency.
Region-based progressive stereo matching
2004-01-01
1005963 byte
Conference paper
Electronic Resource
English
Region-Based Progressive Stereo Matching
British Library Conference Proceedings | 2004
|A progressive framework for dense stereo matching
British Library Online Contents | 2016
|Progressive Linear Search for Stereo Matching and Its Application to Interframe Interpolation
British Library Online Contents | 2001
|Color Motion Stereo Based on Improved Stereo Matching
British Library Online Contents | 2002
|Deep Progressive Fusion Stereo Network
IEEE | 2022
|