Point Cloud Segmentation based on Hypergraph Spectral Clustering
arXiv:2001.07797 · doi:10.1109/ITA50056.2020.9244954
Abstract
Hypergraph spectral analysis has emerged as an effective tool processing complex data structures in data analysis. The surface of a three-dimensional (3D) point cloud and the multilateral relationship among their points can be naturally captured by the high-dimensional hyperedges. This work investigates the power of hypergraph spectral analysis in unsupervised segmentation of 3D point clouds. We estimate and order the hypergraph spectrum from observed point cloud coordinates. By trimming the redundancy from the estimated hypergraph spectral space based on spectral component strengths, we develop a clustering-based segmentation method. We apply the proposed method to various point clouds, and analyze their respective spectral properties. Our experimental results demonstrate the effectiveness and efficiency of the proposed segmentation method.
References in corpus (10)
- Learning graphs from data: A signal representation perspective
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Stationary Graph Processes and Spectral Estimation
- Topological Signal Processing over Simplicial Complexes
- Fast Resampling of 3D Point Clouds via Graphs
- Spectra of general hypergraphs
- Introducing Hypergraph Signal Processing: Theoretical Foundation and Practical Applications
- Hypergraph Spectral Analysis and Processing in 3D Point Cloud
- Large-Scale 3D Shape Reconstruction and Segmentation from ShapeNet Core55
- Point Cloud Segmentation based on Hypergraph Spectral Clustering