Boosting Multi-view Stereo with Late Cost Aggregation

Jiang Wu, Rui Li, Yu Zhu, Wenxun Zhao, Jinqiu Sun +1 more
1/22/2024
cs.CV

No official code found. Best implementation: Wuuu3511/LAMVSNET (14 stars, last commit 2024-01-24).

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.

View on arXivView PDF

Code Implementations(1)

Wuuu3511/LAMVSNETCommunity100%

Boosting Multi-view Stereo with Late Cost Aggregation

140Shell, MATLABJan 22, 20242 years ago

Cite this paper

@article{wu2024boosting,
  title  = {Boosting Multi-view Stereo with Late Cost Aggregation},
  author = {Jiang Wu and Rui Li and Yu Zhu and Wenxun Zhao and Jinqiu Sun and Yanning Zhang},
  year   = {2024},
  eprint = {2401.11751},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.11751v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.11751.svg)](https://codeofpaper.com/paper/2401.11751)

Discussion