Concavity-Induced Distance for Unoriented Point Cloud Decomposition

• URL: http://arxiv.org/abs/2306.11051v1
• Date: Mon, 19 Jun 2023 16:35:09 GMT
• Title: Concavity-Induced Distance for Unoriented Point Cloud Decomposition
• Authors: Ruoyu Wang, Yanfei Xue, Bharath Surianarayanan, Dong Tian, and Chen Feng
• Abstract summary: Concavity-induced Distance (CID) is a novel way to measure the dissimilarity between a pair of points in an unoriented point cloud. We demonstrate how CID can benefit point cloud analysis without the need for meshing or normal estimation.
• Score: 10.222671903932612
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We propose Concavity-induced Distance (CID) as a novel way to measure the dissimilarity between a pair of points in an unoriented point cloud. CID indicates the likelihood of two points or two sets of points belonging to different convex parts of an underlying shape represented as a point cloud. After analyzing its properties, we demonstrate how CID can benefit point cloud analysis without the need for meshing or normal estimation, which is beneficial for robotics applications when dealing with raw point cloud observations. By randomly selecting very few points for manual labeling, a CID-based point cloud instance segmentation via label propagation achieves comparable average precision as recent supervised deep learning approaches, on S3DIS and ScanNet datasets. Moreover, CID can be used to group points into approximately convex parts whose convex hulls can be used as compact scene representations in robotics, and it outperforms the baseline method in terms of grouping quality. Our project website is available at: https://ai4ce.github.io/CID/

Related papers

• Trainable Pointwise Decoder Module for Point Cloud Segmentation [12.233802912441476]
  Point cloud segmentation (PCS) aims to make per-point predictions and enables robots and autonomous driving cars to understand the environment. We propose a trainable pointwise decoder module (PDM) as the post-processing approach. We also introduce a virtual range image-guided copy-rotate-paste strategy in data augmentation.
  arXiv  Detail & Related papers  (2024-08-02T19:29:35Z)
• PointSSC: A Cooperative Vehicle-Infrastructure Point Cloud Benchmark for Semantic Scene Completion [4.564209472726044]
  Semantic Scene Completion aims to jointly generate space occupancies and semantic labels for complex 3D scenes. PointSSC is the first cooperative vehicle-infrastructure point cloud benchmark for semantic scene completion.
  arXiv  Detail & Related papers  (2023-09-22T08:39:16Z)
• Clustering based Point Cloud Representation Learning for 3D Analysis [80.88995099442374]
  We propose a clustering based supervised learning scheme for point cloud analysis. Unlike current de-facto, scene-wise training paradigm, our algorithm conducts within-class clustering on the point embedding space. Our algorithm shows notable improvements on famous point cloud segmentation datasets.
  arXiv  Detail & Related papers  (2023-07-27T03:42:12Z)
• 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)
• PointDC:Unsupervised Semantic Segmentation of 3D Point Clouds via Cross-modal Distillation and Super-Voxel Clustering [32.18716273358168]
  We take the first attempt for fully unsupervised semantic segmentation of point clouds. We propose a novel framework, PointDC, comprised of two steps that handle the aforementioned problems. PointDC yields a significant improvement over the prior state-of-the-art unsupervised methods.
  arXiv  Detail & Related papers  (2023-04-18T12:58:21Z)
• GPCO: An Unsupervised Green Point Cloud Odometry Method [64.86292006892093]
  A lightweight point cloud odometry solution is proposed and named the green point cloud odometry (GPCO) method. GPCO is an unsupervised learning method that predicts object motion by matching features of consecutive point cloud scans. It is observed that GPCO outperforms benchmarking deep learning methods in accuracy while it has a significantly smaller model size and less training time.
  arXiv  Detail & Related papers  (2021-12-08T00:24:03Z)
• UPDesc: Unsupervised Point Descriptor Learning for Robust Registration [54.95201961399334]
  UPDesc is an unsupervised method to learn point descriptors for robust point cloud registration. We show that our learned descriptors yield superior performance over existing unsupervised methods.
  arXiv  Detail & Related papers  (2021-08-05T17:11:08Z)
• Learning Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• PointLIE: Locally Invertible Embedding for Point Cloud Sampling and Recovery [35.353458457283544]
  Point Cloud Sampling and Recovery (PCSR) is critical for massive real-time point cloud collection and processing. We propose a novel Locally Invertible Embedding for point cloud adaptive sampling and recovery (PointLIE) PointLIE unifies point cloud sampling and upsampling to one single framework through bi-directional learning.
  arXiv  Detail & Related papers  (2021-04-30T05:55:59Z)
• 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)
• DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point Cloud Registration [12.471564670462344]
  This work addresses the problem of point cloud registration using deep neural networks. We propose an approach to predict the alignment between two point clouds with overlapping data content, but displaced origins. Our approach achieves state-of-the-art accuracy and the lowest run-time of the compared methods.
  arXiv  Detail & Related papers  (2020-07-22T08:20:57Z)

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.