KD-PatchMatch: A Self-Supervised Training Learning-Based PatchMatch

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Traditional learning-based multi-view stereo (MVS) methods usually need to find the correct depth value from a large number of depth candidates, which leads to huge memory consumption and slow inference. To address these problems, we propose a probabilistic depth sampling in the learning-based PatchMatch framework, i.e., sampling a small number of depth candidates from a single-view probability distribution, which achieves the purpose of saving computational resources. Furthermore, to overcome the difficulty of obtaining ground-truth depth for outdoor large-scale scenes, we also propose a self-supervised training pipeline based on knowledge distillation, which involves self-supervised teacher training and student training based on knowledge distillation. Extensive experiments show that our approach outperforms other recent learning-based MVS methods on DTU, Tanks and Temples, and ETH3D datasets.

Cite

CITATION STYLE

APA

Tan, Q., Fang, Z., & Jiang, X. (2023). KD-PatchMatch: A Self-Supervised Training Learning-Based PatchMatch. Applied Sciences (Switzerland), 13(4). https://doi.org/10.3390/app13042224

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free