mlsanityData to 7 Oct 2026

Stereo Matching With Color-Weighted Correlation, Hierarchical Belief Propagation And Occlusion Handling

arXiv 1708.07987 ↗First posted 26 Aug 2017cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

In this paper, we contrive a stereo matching algorithm with careful handling of disparity, discontinuity and occlusion. This algorithm works a worldwide matching stereo model which is based on minimization of energy. The global energy comprises two terms, firstly the data term and secondly the smoothness term. The data term is approximated by a color-weighted correlation, then refined in obstruct and low-texture areas in many applications of hierarchical loopy belief propagation algorithm. The results during the experiment are evaluated on the Middlebury data sets, showing that out algorithm is the top performer among all the algorithms listed there

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Aug 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 5; 2023: 4; 2024: 1.

13 papers.

Sort: