Stereo Matching by Joint Energy Minimization
In [18], Mozerov et al. propose to perform stereo matching as a two-step energy minimization problem. For the first step they solve a fully connected MRF model. And in the next step the marginal output is employed as the unary cost for a locally connected MRF model. In this paper we intend to combine the two steps of energy minimization in order to improve stereo matching results. We observe that the fully connected MRF leads to smoother disparity maps, while the locally connected MRF achieves superior results in fine-structured regions. Thus we propose to jointly solve the fully connected and locally connected models, taking both their advantages into account. The joint model is solved by mean field approximations. While remaining efficient, our joint model outperforms the two-step energy minimization approach in both time and estimation error on the Middlebury stereo benchmark v3.
Code (0)
등록된 구현이 없습니다.
Tasks
Stereo MatchingStereo Matching HandSimilar Papers 제목 키워드 기반
Stereo Matching With Color-Weighted Correlation, Hierarchical Belief Propagation And Occlusion Handling
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…
Occlusion HandlingStereo MatchingStereo Matching HandGraph Cut based Continuous Stereo Matching using Locally Shared Labels
We present an accurate and efficient stereo matching method using locally shared labels, a new labeling scheme that enables spatial propagation in MRF inference using graph cuts. They give each pixel and region a set of …
Disparity EstimationStereo MatchingStereo Matching HandOne-view occlusion detection for stereo matching with a fully connected CRF model
In this paper, we extend the standard belief propagation (BP) sequential technique proposed in the tree-reweighted sequential method to the fully connected CRF models with the geodesic distance affinity. The proposed met…
Stereo MatchingStereo Matching HandA new stereo formulation not using pixel and disparity models
We introduce a new stereo formulation which does not use pixel and disparity models. Many problems in vision are treated as assigning each pixel a label. Disparities are labels for stereo. Such pixel-labeling problems ar…
GPUExtended Dynamic Programming and Fast Multidimensional Search Algorithm for Energy Minization in Stereo and Motion
This paper presents a novel extended dynamic programming approach for energy minimization (EDP) to solve the correspondence problem for stereo and motion. A significant speedup is achieved using a recursive minimum searc…
GPU