Stereo Matching with Cost Volume based Sparse Disparity Propagation

• URL: http://arxiv.org/abs/2201.11937v1
• Date: Fri, 28 Jan 2022 05:20:41 GMT
• Title: Stereo Matching with Cost Volume based Sparse Disparity Propagation
• Authors: Wei Xue and Xiaojiang Peng
• Abstract summary: We propose a simple yet novel scheme to improve general stereo matching based on matching cost volume and sparse matching feature points. Our scheme achieves promising performance comparable to state-of-the-art methods.
• Score: 27.74131924190943
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Stereo Risk: A Continuous Modeling Approach to Stereo Matching [110.22344879336043]
  We introduce Stereo Risk, a new deep-learning approach to solve the classical stereo-matching problem in computer vision. We demonstrate that Stereo Risk enhances stereo-matching performance for deep networks, particularly for disparities with multi-modal probability distributions. A comprehensive analysis demonstrates our method's theoretical soundness and superior performance over the state-of-the-art methods across various benchmark datasets.
  arXiv  Detail & Related papers  (2024-07-03T14:30:47Z)
• Modeling Stereo-Confidence Out of the End-to-End Stereo-Matching Network via Disparity Plane Sweep [31.261772846687297]
  The proposed stereo-confidence method is built upon the idea that any shift in a stereo-image pair should be updated in a corresponding amount shift in the disparity map. By comparing the desirable and predicted disparity profiles, we can quantify the level of matching ambiguity between left and right images for confidence measurement.
  arXiv  Detail & Related papers  (2024-01-22T14:52:08Z)
• Boosting Multi-view Stereo with Late Cost Aggregation [47.59150287682573]
  Pairwise matching cost aggregation is a crucial step for modern learning-based Multi-view Stereo (MVS) We present a late aggregation approach that allows for aggregating pairwise costs throughout the network feed-forward process. This enables the succeeding depth network to fully utilize the crucial geometric cues without loss of cost fidelity.
  arXiv  Detail & Related papers  (2024-01-22T08:23:52Z)
• OccCasNet: Occlusion-aware Cascade Cost Volume for Light Field Depth Estimation [26.572015989990845]
  We propose an occlusion-aware cascade cost volume for LF depth (disparity) estimation. Our strategy reduces the sampling number while keeping the sampling interval constant during the construction of a finer cost volume. Our method achieves a superior balance between accuracy and efficiency and ranks first in terms of MSE and Q25 metrics.
  arXiv  Detail & Related papers  (2023-05-28T12:31:27Z)
• Revisiting Domain Generalized Stereo Matching Networks from a Feature Consistency Perspective [65.37571681370096]
  We propose a simple pixel-wise contrastive learning across the viewpoints. A stereo selective whitening loss is introduced to better preserve the stereo feature consistency across domains. Our method achieves superior performance over several state-of-the-art networks.
  arXiv  Detail & Related papers  (2022-03-21T11:21:41Z)
• AdaStereo: An Efficient Domain-Adaptive Stereo Matching Approach [50.855679274530615]
  We present a novel domain-adaptive approach called AdaStereo to align multi-level representations for deep stereo matching networks. Our models achieve state-of-the-art cross-domain performance on multiple benchmarks, including KITTI, Middlebury, ETH3D and DrivingStereo. Our method is robust to various domain adaptation settings, and can be easily integrated into quick adaptation application scenarios and real-world deployments.
  arXiv  Detail & Related papers  (2021-12-09T15:10:47Z)
• Correlate-and-Excite: Real-Time Stereo Matching via Guided Cost Volume Excitation [65.83008812026635]
  We construct Guided Cost volume Excitation (GCE) and show that simple channel excitation of cost volume guided by image can improve performance considerably. We present an end-to-end network that we call Correlate-and-Excite (CoEx)
  arXiv  Detail & Related papers  (2021-08-12T14:32:26Z)
• A Decomposition Model for Stereo Matching [43.04003114948216]
  We present a decomposition model for stereo matching to solve the problem of excessive growth in computational cost as the resolution increases. Our model only runs dense matching at a very low resolution and uses sparse matching at different higher resolutions to recover the disparity of lost details scale-by-scale.
  arXiv  Detail & Related papers  (2021-04-15T15:16:23Z)
• CFNet: Cascade and Fused Cost Volume for Robust Stereo Matching [27.313740022587442]
  We propose CFNet, a Cascade and Fused cost volume based network to improve the robustness of the stereo matching network. We employ a variance-based uncertainty estimation to adaptively adjust the next stage disparity search space. Our proposed method achieves the state-of-the-art overall performance and obtains the 1st place on the stereo task of Robust Vision Challenge 2020.
  arXiv  Detail & Related papers  (2021-04-09T11:38:59Z)
• Expanding Sparse Guidance for Stereo Matching [24.74333370941674]
  We propose a novel sparsity expansion technique to expand the sparse cues concerning RGB images for local feature enhancement. Our approach significantly boosts the existing state-of-the-art stereo algorithms with extremely sparse cues.
  arXiv  Detail & Related papers  (2020-04-24T06:41:11Z)
• AdaStereo: A Simple and Efficient Approach for Adaptive Stereo Matching [50.06646151004375]
  A novel domain-adaptive pipeline called AdaStereo aims to align multi-level representations for deep stereo matching networks. Our AdaStereo models achieve state-of-the-art cross-domain performance on multiple stereo benchmarks, including KITTI, Middlebury, ETH3D, and DrivingStereo.
  arXiv  Detail & Related papers  (2020-04-09T16:15:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.