Grad-PU: Arbitrary-Scale Point Cloud Upsampling via Gradient Descent
with Learned Distance Functions
- URL: http://arxiv.org/abs/2304.11846v1
- Date: Mon, 24 Apr 2023 06:36:35 GMT
- Title: Grad-PU: Arbitrary-Scale Point Cloud Upsampling via Gradient Descent
with Learned Distance Functions
- Authors: Yun He and Danhang Tang and Yinda Zhang and Xiangyang Xue and Yanwei
Fu
- Abstract summary: We propose a new framework for accurate point cloud upsampling that supports arbitrary upsampling rates.
Our method first interpolates the low-res point cloud according to a given upsampling rate.
- Score: 77.32043242988738
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most existing point cloud upsampling methods have roughly three steps:
feature extraction, feature expansion and 3D coordinate prediction.
However,they usually suffer from two critical issues: (1)fixed upsampling rate
after one-time training, since the feature expansion unit is customized for
each upsampling rate; (2)outliers or shrinkage artifact caused by the
difficulty of precisely predicting 3D coordinates or residuals of upsampled
points. To adress them, we propose a new framework for accurate point cloud
upsampling that supports arbitrary upsampling rates. Our method first
interpolates the low-res point cloud according to a given upsampling rate. And
then refine the positions of the interpolated points with an iterative
optimization process, guided by a trained model estimating the difference
between the current point cloud and the high-res target. Extensive quantitative
and qualitative results on benchmarks and downstream tasks demonstrate that our
method achieves the state-of-the-art accuracy and efficiency.
Related papers
- Arbitrary-Scale Point Cloud Upsampling by Voxel-Based Network with
Latent Geometric-Consistent Learning [52.825441454264585]
We propose an arbitrary-scale Point cloud Upsampling framework using Voxel-based Network (textbfPU-VoxelNet)
Thanks to the completeness and regularity inherited from the voxel representation, voxel-based networks are capable of providing predefined grid space to approximate 3D surface.
A density-guided grid resampling method is developed to generate high-fidelity points while effectively avoiding sampling outliers.
arXiv Detail & Related papers (2024-03-08T07:31:14Z) - Learning Continuous Implicit Field with Local Distance Indicator for
Arbitrary-Scale Point Cloud Upsampling [55.05706827963042]
Point cloud upsampling aims to generate dense and uniformly distributed point sets from a sparse point cloud.
Previous methods typically split a sparse point cloud into several local patches, upsample patch points, and merge all upsampled patches.
We propose a novel approach that learns an unsigned distance field guided by local priors for point cloud upsampling.
arXiv Detail & Related papers (2023-12-23T01:52:14Z) - iPUNet:Iterative Cross Field Guided Point Cloud Upsampling [20.925921503694894]
Point clouds acquired by 3D scanning devices are often sparse, noisy, and non-uniform, causing a loss of geometric features.
We present a learning-based point upsampling method, iPUNet, which generates dense and uniform points at arbitrary ratios.
We demonstrate that iPUNet is robust to handle noisy and non-uniformly distributed inputs, and outperforms state-of-the-art point cloud upsampling methods.
arXiv Detail & Related papers (2023-10-13T13:24:37Z) - BIMS-PU: Bi-Directional and Multi-Scale Point Cloud Upsampling [60.257912103351394]
We develop a new point cloud upsampling pipeline called BIMS-PU.
We decompose the up/downsampling procedure into several up/downsampling sub-steps by breaking the target sampling factor into smaller factors.
We show that our method achieves superior results to state-of-the-art approaches.
arXiv Detail & Related papers (2022-06-25T13:13:37Z) - PU-EVA: An Edge Vector based Approximation Solution for Flexible-scale
Point Cloud Upsampling [4.418205951027186]
Upsampling sparse, noisy and nonuniform point clouds is a challenging task.
A novel design of Edge Vector based Approximation for Flexible-scale Point clouds Upsampling (PU-EVA) is proposed.
The EVA upsampling decouples the upsampling scales with network architecture, achieving the flexible upsampling rates in one-time training.
arXiv Detail & Related papers (2022-04-22T15:14:05Z) - Self-Supervised Arbitrary-Scale Point Clouds Upsampling via Implicit
Neural Representation [79.60988242843437]
We propose a novel approach that achieves self-supervised and magnification-flexible point clouds upsampling simultaneously.
Experimental results demonstrate that our self-supervised learning based scheme achieves competitive or even better performance than supervised learning based state-of-the-art methods.
arXiv Detail & Related papers (2022-04-18T07:18:25Z) - PC2-PU: Patch Correlation and Position Correction for Effective Point
Cloud Upsampling [12.070762117164092]
Point cloud upsampling is to densify a sparse point set acquired from 3D sensors.
Existing methods perform upsampling on a single patch, ignoring the coherence and relation of the entire surface.
We present a novel method for more effective point cloud upsampling, achieving a more robust and improved performance.
arXiv Detail & Related papers (2021-09-20T07:40:20Z) - SPU-Net: Self-Supervised Point Cloud Upsampling by Coarse-to-Fine
Reconstruction with Self-Projection Optimization [52.20602782690776]
It is expensive and tedious to obtain large scale paired sparse-canned point sets for training from real scanned sparse data.
We propose a self-supervised point cloud upsampling network, named SPU-Net, to capture the inherent upsampling patterns of points lying on the underlying object surface.
We conduct various experiments on both synthetic and real-scanned datasets, and the results demonstrate that we achieve comparable performance to the state-of-the-art supervised methods.
arXiv Detail & Related papers (2020-12-08T14:14:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.