Stereo Matching with Cost Volume based Sparse Disparity Propagation
원문 초록
Stereo matching is crucial for binocular stereo vision. Existing methods mainly focus on simple disparity map fusion to improve stereo matching, which require multiple dense or sparse disparity maps. In this paper, we propose a simple yet novel scheme, termed feature disparity propagation, to improve general stereo matching based on matching cost volume and sparse matching feature points. Specifically, our scheme first calculates a reliable sparse disparity map by local feature matching, and then refines the disparity map by propagating reliable disparities to neighboring pixels in the matching cost domain. In addition, considering the gradient and multi-scale information of local disparity regions, we present a $\rho$-Census cost measure based on the well-known AD-Census, which guarantees the robustness of cost volume even without the cost aggregation step. Extensive experiments on Middlebury stereo benchmark V3 demonstrate that our scheme achieves promising performance comparable to state-of-the-art methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ESMStereo: Enhanced ShuffleMixer Disparity Upsampling for Real-Time and Accurate Stereo Matching
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
Multi-Label Stereo Matching for Transparent Scene Depth Estimation
Diving into the Fusion of Monocular Priors for Generalized Stereo Matching
Boosting Omnidirectional Stereo Matching with a Pre-trained Depth Foundation Model
Distilling Stereo Networks for Performant and Efficient Leaner Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.