DPDist : Comparing Point Clouds Using Deep Point Cloud Distance

• URL: http://arxiv.org/abs/2004.11784v2
• Date: Thu, 23 Jul 2020 07:46:09 GMT
• Title: DPDist : Comparing Point Clouds Using Deep Point Cloud Distance
• Authors: Dahlia Urbach, Yizhak Ben-Shabat, Michael Lindenbaum
• Abstract summary: We introduce a new deep learning method for point cloud comparison. Our approach, named Deep Point Cloud Distance (DPDist), measures the distance between the points in one cloud and the estimated surface from which the other point cloud is sampled.
• Score: 12.676356746752898
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a new deep learning method for point cloud comparison. Our approach, named Deep Point Cloud Distance (DPDist), measures the distance between the points in one cloud and the estimated surface from which the other point cloud is sampled. The surface is estimated locally and efficiently using the 3D modified Fisher vector representation. The local representation reduces the complexity of the surface, enabling efficient and effective learning, which generalizes well between object categories. We test the proposed distance in challenging tasks, such as similar object comparison and registration, and show that it provides significant improvements over commonly used distances such as Chamfer distance, Earth mover's distance, and others.

Related papers

• 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)
• GridPull: Towards Scalability in Learning Implicit Representations from 3D Point Clouds [60.27217859189727]
  We propose GridPull to improve the efficiency of learning implicit representations from large scale point clouds. Our novelty lies in the fast inference of a discrete distance field defined on grids without using any neural components. We use uniform grids for a fast grid search to localize sampled queries, and organize surface points in a tree structure to speed up the calculation of distances to the surface.
  arXiv  Detail & Related papers  (2023-08-25T04:52:52Z)
• DELFlow: Dense Efficient Learning of Scene Flow for Large-Scale Point Clouds [42.64433313672884]
  We regularize raw points to a dense format by storing 3D coordinates in 2D grids. Unlike the sampling operation commonly used in existing works, the dense 2D representation preserves most points. We also present a novel warping projection technique to alleviate the information loss problem.
  arXiv  Detail & Related papers  (2023-08-08T16:37:24Z)
• Unleash the Potential of 3D Point Cloud Modeling with A Calibrated Local Geometry-driven Distance Metric [62.365983810610985]
  We propose a novel distance metric called Calibrated Local Geometry Distance (CLGD) CLGD computes the difference between the underlying 3D surfaces calibrated and induced by a set of reference points. As a generic metric, CLGD has the potential to advance 3D point cloud modeling.
  arXiv  Detail & Related papers  (2023-06-01T11:16:20Z)
• CAP-UDF: Learning Unsigned Distance Functions Progressively from Raw Point Clouds with Consistency-Aware Field Optimization [54.69408516025872]
  CAP-UDF is a novel method to learn consistency-aware UDF from raw point clouds. We train a neural network to gradually infer the relationship between queries and the approximated surface. We also introduce a polygonization algorithm to extract surfaces using the gradients of the learned UDF.
  arXiv  Detail & Related papers  (2022-10-06T08:51:08Z)
• Reconstructing Surfaces for Sparse Point Clouds with On-Surface Priors [52.25114448281418]
  Current methods are able to reconstruct surfaces by learning Signed Distance Functions (SDFs) from single point clouds without ground truth signed distances or point normals. We propose to reconstruct highly accurate surfaces from sparse point clouds with an on-surface prior. Our method can learn SDFs from a single sparse point cloud without ground truth signed distances or point normals.
  arXiv  Detail & Related papers  (2022-04-22T09:45:20Z)
• 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)
• Point-set Distances for Learning Representations of 3D Point Clouds [21.860204082926415]
  We propose to use a variant of the Wasserstein distance, named the sliced Wasserstein distance, for learning representations of 3D point clouds. Experiments show that the sliced Wasserstein distance allows the neural network to learn a more efficient representation compared to the Chamfer discrepancy.
  arXiv  Detail & Related papers  (2021-02-08T06:09:13Z)

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.