Fast Resampling of Three-Dimensional Point Clouds via Graphs
From MaRDI portal
Publication:4621576
DOI10.1109/TSP.2017.2771730zbMATH Open1414.94858arXiv1702.06397MaRDI QIDQ4621576FDOQ4621576
Authors: Siheng Chen, Dong Tian, Chen Feng, Anthony Vetro, Jelena Kovačević 
Publication date: 12 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: To reduce cost in storing, processing and visualizing a large-scale point cloud, we consider a randomized resampling strategy to select a representative subset of points while preserving application-dependent features. The proposed strategy is based on graphs, which can represent underlying surfaces and lend themselves well to efficient computation. We use a general feature-extraction operator to represent application-dependent features and propose a general reconstruction error to evaluate the quality of resampling. We obtain a general form of optimal resampling distribution by minimizing the reconstruction error. The proposed optimal resampling distribution is guaranteed to be shift, rotation and scale-invariant in the 3D space. We next specify the feature-extraction operator to be a graph filter and study specific resampling strategies based on all-pass, low-pass, high-pass graph filtering and graph filter banks. We finally apply the proposed methods to three applications: large-scale visualization, accurate registration and robust shape modeling. The empirical performance validates the effectiveness and efficiency of the proposed resampling methods.
Full work available at URL: https://arxiv.org/abs/1702.06397
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Cited In (1)
This page was built for publication: Fast Resampling of Three-Dimensional Point Clouds via Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621576)
