HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Planar Prior Assisted PatchMatch Multi-View Stereo

Qingshan Xu Wenbing Tao

Planar Prior Assisted PatchMatch Multi-View Stereo

Abstract

The completeness of 3D models is still a challenging problem in multi-view stereo (MVS) due to the unreliable photometric consistency in low-textured areas. Since low-textured areas usually exhibit strong planarity, planar models are advantageous to the depth estimation of low-textured areas. On the other hand, PatchMatch multi-view stereo is very efficient for its sampling and propagation scheme. By taking advantage of planar models and PatchMatch multi-view stereo, we propose a planar prior assisted PatchMatch multi-view stereo framework in this paper. In detail, we utilize a probabilistic graphical model to embed planar models into PatchMatch multi-view stereo and contribute a novel multi-view aggregated matching cost. This novel cost takes both photometric consistency and planar compatibility into consideration, making it suited for the depth estimation of both non-planar and planar regions. Experimental results demonstrate that our method can efficiently recover the depth information of extremely low-textured areas, thus obtaining high complete 3D models and achieving state-of-the-art performance.

Code Repositories

GhiXu/ACMP
Official
Mentioned in GitHub

Benchmarks

BenchmarkMethodologyMetrics
multi-view-3d-reconstruction-on-eth3dACMP
F1 score: 81.51

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Planar Prior Assisted PatchMatch Multi-View Stereo | Papers | HyperAI