Arbitrary point cloud upsampling via Dual Back-Projection Network

Zhi-Song Liu, Zijia Wang, Zhen Jia
7/18/2023
cs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Point clouds acquired from 3D sensors are usually sparse and noisy. Point cloud upsampling is an approach to increase the density of the point cloud so that detailed geometric information can be restored. In this paper, we propose a Dual Back-Projection network for point cloud upsampling (DBPnet). A Dual Back-Projection is formulated in an up-down-up manner for point cloud upsampling. It not only back projects feature residues but also coordinates residues so that the network better captures the point correlations in the feature and space domains, achieving lower reconstruction errors on both uniform and non-uniform sparse point clouds. Our proposed method is also generalizable for arbitrary upsampling tasks (e.g. 4x, 5.5x). Experimental results show that the proposed method achieves the lowest point set matching losses with respect to the benchmark. In addition, the success of our approach demonstrates that generative networks are not necessarily needed for non-uniform point clouds.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{liu2023arbitrary,
  title  = {Arbitrary point cloud upsampling via Dual Back-Projection Network},
  author = {Zhi-Song Liu and Zijia Wang and Zhen Jia},
  year   = {2023},
  eprint = {2307.08992},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.08992v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.08992.svg)](https://codeofpaper.com/paper/2307.08992)

Discussion