Demo Data from EDBT 2026 / reviewers in the wild / expert
Wenxun Zhao
dblp:337/3890
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
3D vision · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › stereo vision › stereo matching
cost aggregation |
0.8 | 1 | 2024 | GoMVS: Geometrically Consistent Cost Aggregation for Multi-View Stereo · CVPR 2024 |
Computer vision › 3D vision
depth estimation |
0.8 | 1 | 2024 | GoMVS: Geometrically Consistent Cost Aggregation for Multi-View Stereo · CVPR 2024 |
Computer vision › 3D vision › 3d reconstruction
multi-view stereo |
0.8 | 1 | 2024 | GoMVS: Geometrically Consistent Cost Aggregation for Multi-View Stereo · CVPR 2024 |
Methods — techniques the papers use, named apart from their topics
surface normal propagation · 0.8convolutional aggregation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | GoMVS: Geometrically Consistent Cost Aggregation for Multi-View StereoabstractMatching cost aggregation plays a fundamental role in learning-based multi-view stereo networks. However, di-rectly aggregating adjacent costs can lead to suboptimal results due to local geometric inconsistency. Related meth-ods either seek selective aggregation or improve aggregated depth in the 2D space, both are unable to handle geomet-ric inconsistency in the cost volume effectively. In this pa-per, we propose GoMVS to aggregate geometrically consis-tent costs, yielding better utilization of adjacent geometries. More specifically, we correspond and propagate adjacent costs to the reference pixel by leveraging the local geomet-ric smoothness in conjunction with surface normals. We achieve this by the geometric consistent propagation (GCP) module. It computes the correspondence from the adjacent depth hypothesis space to the reference depth space using surface normals, then uses the correspondence to propa-gate adjacent costs to the reference geometry, followed by a convolution for aggregation. Our method achieves new state-of-the-art performance on DTU, Tanks & Temple, and ETH3D datasets. Notably, our method ranks 1st on the Tanks & Temple Advanced benchmark. Code is available at https://github.com/Wuuu3511IGoMVS. Rui Li 0013, Haofei Xu, Wenxun Zhao, Yu Zhu 0004, Jinqiu Sun, Yanning Zhang 0001 |
CVPR | 4 |