Boosting Multi-view Stereo with Late Cost Aggregation

• URL: http://arxiv.org/abs/2401.11751v2
• Date: Wed, 24 Jan 2024 15:53:08 GMT
• Title: Boosting Multi-view Stereo with Late Cost Aggregation
• Authors: Jiang Wu, Rui Li, Yu Zhu, Wenxun Zhao, Jinqiu Sun, Yanning Zhang
• Abstract summary: 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.
• Score: 47.59150287682573
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Pairwise matching cost aggregation is a crucial step for modern learning-based Multi-view Stereo (MVS). Prior works adopt an early aggregation scheme, which adds up pairwise costs into an intermediate cost. However, we analyze that this process can degrade informative pairwise matchings, thereby blocking the depth network from fully utilizing the original geometric matching cues. To address this challenge, we present a late aggregation approach that allows for aggregating pairwise costs throughout the network feed-forward process, achieving accurate estimations with only minor changes of the plain CasMVSNet. Instead of building an intermediate cost by weighted sum, late aggregation preserves all pairwise costs along a distinct view channel. This enables the succeeding depth network to fully utilize the crucial geometric cues without loss of cost fidelity. Grounded in the new aggregation scheme, we propose further techniques addressing view order dependence inside the preserved cost, handling flexible testing views, and improving the depth filtering process. Despite its technical simplicity, our method improves significantly upon the baseline cascade-based approach, achieving comparable results with state-of-the-art methods with favorable computation overhead.

Related papers

• Network reconstruction via the minimum description length principle [0.0]
  We propose an alternative nonparametric regularization scheme based on hierarchical Bayesian inference and weight quantization. Our approach follows the minimum description length (MDL) principle, and uncovers the weight distribution that allows for the most compression of the data. We demonstrate that our scheme yields systematically increased accuracy in the reconstruction of both artificial and empirical networks.
  arXiv  Detail & Related papers  (2024-05-02T05:35:09Z)
• Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence [51.54175067684008]
  This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. We first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes. Our framework is evaluated on standard benchmarks for semantic matching, and also applied to geometric matching, where we show that our approach achieves significant improvements compared to existing methods.
  arXiv  Detail & Related papers  (2024-03-17T07:02:55Z)
• TrackFlow: Multi-Object Tracking with Normalizing Flows [36.86830078167583]
  We aim at extending tracking-by-detection to multi-modal settings. A rough estimate of 3D information is also available and must be merged with other traditional metrics. Our approach consistently enhances the performance of several tracking-by-detection algorithms.
  arXiv  Detail & Related papers  (2023-08-22T15:40:03Z)
• Stereo Matching with Cost Volume based Sparse Disparity Propagation [27.74131924190943]
  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.
  arXiv  Detail & Related papers  (2022-01-28T05:20:41Z)
• Multi-View Stereo Network with attention thin volume [0.0]
  We propose an efficient multi-view stereo (MVS) network for infering depth value from multiple RGB images. We introduce the self-attention mechanism to fully aggregate the dominant information from input images. We also introduce the group-wise correlation to feature aggregation, which greatly reduces the memory and calculation burden.
  arXiv  Detail & Related papers  (2021-10-16T11:51:23Z)
• 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)
• Semantic Correspondence with Transformers [68.37049687360705]
  We propose Cost Aggregation with Transformers (CATs) to find dense correspondences between semantically similar images. We include appearance affinity modelling to disambiguate the initial correlation maps and multi-level aggregation. We conduct experiments to demonstrate the effectiveness of the proposed model over the latest methods and provide extensive ablation studies.
  arXiv  Detail & Related papers  (2021-06-04T14:39:03Z)
• Manifold Regularized Dynamic Network Pruning [102.24146031250034]
  This paper proposes a new paradigm that dynamically removes redundant filters by embedding the manifold information of all instances into the space of pruned networks. The effectiveness of the proposed method is verified on several benchmarks, which shows better performance in terms of both accuracy and computational cost.
  arXiv  Detail & Related papers  (2021-03-10T03:59:03Z)
• Deep Shells: Unsupervised Shape Correspondence with Optimal Transport [52.646396621449]
  We propose a novel unsupervised learning approach to 3D shape correspondence. We show that the proposed method significantly improves over the state-of-the-art on multiple datasets.
  arXiv  Detail & Related papers  (2020-10-28T22:24:07Z)

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.