Movatterモバイル変換


[0]ホーム

URL:


close this message
arXiv smileybones

arXiv Is Hiring Software Developers

Work on one of the world's most important websites and make an impact on open science.

View Jobs
Skip to main content
Cornell University

arXiv Is Hiring Software Devs

View Jobs
We gratefully acknowledge support from the Simons Foundation,member institutions, and all contributors.Donate
arxiv logo>cs> arXiv:2205.14320
arXiv logo
Cornell University Logo

Computer Science > Computer Vision and Pattern Recognition

arXiv:2205.14320 (cs)
[Submitted on 28 May 2022 (v1), last revised 5 Nov 2024 (this version, v4)]

Title:RIAV-MVS: Recurrent-Indexing an Asymmetric Volume for Multi-View Stereo

View PDFHTML (experimental)
Abstract:This paper presents a learning-based method for multi-view depth estimation from posed images. Our core idea is a "learning-to-optimize" paradigm that iteratively indexes a plane-sweeping cost volume and regresses the depth map via a convolutional Gated Recurrent Unit (GRU). Since the cost volume plays a paramount role in encoding the multi-view geometry, we aim to improve its construction both at pixel- and frame- levels. At the pixel level, we propose to break the symmetry of the Siamese network (which is typically used in MVS to extract image features) by introducing a transformer block to the reference image (but not to the source images). Such an asymmetric volume allows the network to extract global features from the reference image to predict its depth map. Given potential inaccuracies in the poses between reference and source images, we propose to incorporate a residual pose network to correct the relative poses. This essentially rectifies the cost volume at the frame level. We conduct extensive experiments on real-world MVS datasets and show that our method achieves state-of-the-art performance in terms of both within-dataset evaluation and cross-dataset generalization. Code available:this https URL.
Comments:CVPR 2023. Code link added
Subjects:Computer Vision and Pattern Recognition (cs.CV)
Cite as:arXiv:2205.14320 [cs.CV]
 (orarXiv:2205.14320v4 [cs.CV] for this version)
 https://doi.org/10.48550/arXiv.2205.14320
arXiv-issued DOI via DataCite

Submission history

From: Changjiang Cai [view email]
[v1] Sat, 28 May 2022 03:32:56 UTC (12,556 KB)
[v2] Mon, 28 Nov 2022 22:40:19 UTC (22,981 KB)
[v3] Wed, 22 Mar 2023 00:55:32 UTC (23,813 KB)
[v4] Tue, 5 Nov 2024 00:38:29 UTC (23,799 KB)
Full-text links:

Access Paper:

Current browse context:
cs.CV
Change to browse by:
export BibTeX citation

Bookmark

BibSonomy logoReddit logo

Bibliographic and Citation Tools

Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
scite Smart Citations(What are Smart Citations?)

Code, Data and Media Associated with this Article

CatalyzeX Code Finder for Papers(What is CatalyzeX?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)

Demos

Hugging Face Spaces(What is Spaces?)

Recommenders and Search Tools

Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.

Which authors of this paper are endorsers? |Disable MathJax (What is MathJax?)

[8]ページ先頭

©2009-2025 Movatter.jp