EPCS: Endpoint-based Part-aware Curve Skeleton Extraction for Low-quality Point Clouds

• URL: http://arxiv.org/abs/2211.09488v1
• Date: Thu, 17 Nov 2022 12:13:49 GMT
• Title: EPCS: Endpoint-based Part-aware Curve Skeleton Extraction for Low-quality Point Clouds
• Authors: Chunhui Li and Mingquan Zhou and Zehua Liu and Yuhe Zhang
• Abstract summary: endpoint-based part-aware curve skeleton ( EPCS) extraction method for low-quality point clouds is proposed. The proposed EPCS method is compared with several state-of-the-art methods, and the experimental results verify its robustness, effectiveness, and efficiency.
• Score: 3.9243573226410278
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The curve skeleton is an important shape descriptor that has been utilized in various applications in computer graphics, machine vision, and artificial intelligence. In this study, the endpoint-based part-aware curve skeleton (EPCS) extraction method for low-quality point clouds is proposed. The novel random center shift (RCS) method is first proposed for detecting the endpoints on point clouds. The endpoints are used as the initial seed points for dividing each part into layers, and then the skeletal points are obtained by computing the center points of the oriented bounding box (OBB) of the layers. Subsequently, the skeletal points are connected, thus forming the branches. Furthermore, the multi-vector momentum-driven (MVMD) method is also proposed for locating the junction points that connect the branches. Due to the shape differences between different parts on point clouds, the global topology of the skeleton is finally optimized by removing the redundant junction points, re-connecting some branches using the proposed MVMD method, and applying an interpolation method based on the splitting operator. Consequently, a complete and smooth curve skeleton is achieved. The proposed EPCS method is compared with several state-of-the-art methods, and the experimental results verify its robustness, effectiveness, and efficiency. Furthermore, the skeleton extraction and model segmentation results on the point clouds of broken Terracotta also highlight the utility of the proposed method.

Related papers

• HybridFusion: LiDAR and Vision Cross-Source Point Cloud Fusion [15.94976936555104]
  We propose a cross-source point cloud fusion algorithm called HybridFusion. It can register cross-source dense point clouds from different viewing angle in outdoor large scenes. The proposed approach is evaluated comprehensively through qualitative and quantitative experiments.
  arXiv  Detail & Related papers  (2023-04-10T10:54:54Z)
• LAKe-Net: Topology-Aware Point Cloud Completion by Localizing Aligned Keypoints [35.82520172874995]
  LAKe-Net is a novel point cloud completion model by localizing aligned keypoints. A new type of skeleton, named Surface-skeleton, is generated from keypoints based on geometric priors. Experimental results show that our method achieves the state-of-the-art performance on point cloud completion.
  arXiv  Detail & Related papers  (2022-03-31T03:14:48Z)
• PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds [79.99653758293277]
  PCAM is a neural network whose key element is a pointwise product of cross-attention matrices. We show that PCAM achieves state-of-the-art results among methods which, like us, solve steps (a) and (b) jointly via deepnets.
  arXiv  Detail & Related papers  (2021-10-04T09:23:27Z)
• Bend-Net: Bending Loss Regularized Multitask Learning Network for Nuclei Segmentation in Histopathology Images [65.47507533905188]
  We propose a novel multitask learning network with a bending loss regularizer to separate overlapped nuclei accurately. The newly proposed multitask learning architecture enhances the generalization by learning shared representation from three tasks. The proposed bending loss defines high penalties to concave contour points with large curvatures, and applies small penalties to convex contour points with small curvatures.
  arXiv  Detail & Related papers  (2021-09-30T17:29:44Z)
• Determinantal consensus clustering [77.34726150561087]
  We propose the use of determinantal point processes or DPP for the random restart of clustering algorithms. DPPs favor diversity of the center points within subsets. We show through simulations that, contrary to DPP, this technique fails both to ensure diversity, and to obtain a good coverage of all data facets.
  arXiv  Detail & Related papers  (2021-02-07T23:48:24Z)
• 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)
• Point2Skeleton: Learning Skeletal Representations from Point Clouds [36.62519847312199]
  We introduce Point2Skeleton, an unsupervised method to learn skeletal representations from point clouds. We first predict a set of skeletal points by learning a geometric transformation, and then analyze the connectivity of the skeletal points to form skeletal mesh structures.
  arXiv  Detail & Related papers  (2020-12-01T03:04:09Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)
• Skeleton-bridged Point Completion: From Global Inference to Local Adjustment [48.2757171993437]
  We propose a skeleton-bridged point completion network (SK-PCN) for shape completion. Given a partial scan, our method first predicts its 3D skeleton to obtain the global structure. We decouple the shape completion into structure estimation and surface reconstruction, which eases the learning difficulty.
  arXiv  Detail & Related papers  (2020-10-14T22:49:30Z)
• Improving concave point detection to better segment overlapped objects in images [0.0]
  This paper presents a method that improve state-of-the-art of the concave point detection methods as a first step to segment overlapping objects on images. It is based on the analysis of the curvature of the objects contour. As a case study, the performance of a well-known application is evaluated, such as the splitting of overlapped cells in images of peripheral blood smears samples of patients with sickle cell anaemia.
  arXiv  Detail & Related papers  (2020-08-03T16:32:49Z)
• FKAConv: Feature-Kernel Alignment for Point Cloud Convolution [75.85619090748939]
  We provide a formulation to relate and analyze a number of point convolution methods. We also propose our own convolution variant, that separates the estimation of geometry-less kernel weights. We show competitive results on classification and semantic segmentation benchmarks.
  arXiv  Detail & Related papers  (2020-04-09T10:12:45Z)

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.