arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.07992cs.CV

GoMVS:面向多视图立体匹配的几何一致性代价聚合

GoMVS: Geometrically Consistent Cost Aggregation for Multi-View Stereo

Northwestern Polytechnical University(西北工业大学);ETH Zürich(苏黎世联邦理工学院);University of Tübingen(蒂宾根大学)

Jiang Wu, Rui Li, Haofei Xu, Wenxun Zhao, Yu Zhu, Jinqiu Sun, Yanning Zhang

AI总结:

针对多视图立体匹配中直接聚合相邻代价存在局部几何不一致的问题,提出GoMVS方法,通过GCP模块结合几何平滑性与表面法向量实现几何一致性代价聚合,在多个基准数据集上取得SOTA性能。

摘要:

匹配代价聚合在基于学习的多视图立体匹配网络中发挥着基础性作用。然而,直接聚合相邻代价会因局部几何不一致性导致结果欠佳。现有相关方法要么采用选择性聚合策略,要么在2D空间中优化聚合后的深度,均无法有效处理代价体中的几何不一致问题。本文提出GoMVS方法用于聚合具备几何一致性的代价,以更好地利用相邻几何信息。具体而言,该方法结合局部几何平滑性与表面法向量,将相邻代价匹配并传播至参考像素。这一过程通过几何一致性传播(GCP)模块实现:该模块利用表面法向量计算相邻深度假设空间到参考深度空间的对应关系,再基于该对应关系将相邻代价传播至参考几何结构,最后通过卷积完成聚合。实验表明,该方法在DTU、Tanks & Temple和ETH3D数据集上取得了全新的最优性能,尤其在Tanks & Temple Advanced基准上排名第一。

英文摘要:

Matching cost aggregation plays a fundamental role in learning-based multi-view stereo networks. However, directly aggregating adjacent costs can lead to suboptimal results due to local geometric inconsistency. Related methods either seek selective aggregation or improve aggregated depth in the 2D space, both are unable to handle geometric inconsistency in the cost volume effectively. In this paper, we propose GoMVS to aggregate geometrically consistent costs, yielding better utilization of adjacent geometries. More specifically, we correspond and propagate adjacent costs to the reference pixel by leveraging the local geometric 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 propagate 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑