Fast resampling of three-dimensional point clouds via graphs

Siheng Chen, Dong Tian, Chen Feng, Anthony Vetro, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we propose a randomized resampling strategy that selects a representative subset of points while preserving application-dependent features. The 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; by minimizing the error, we obtain a general form of optimal resampling distribution. The proposed resampling distribution is guaranteed to be shift-, rotation- and scale-invariant in the three-dimensional space. We then 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 validate the proposed methods on three applications: Large-scale visualization, accurate registration, and robust shape modeling demonstrating the effectiveness and efficiency of the proposed resampling methods.

Original languageEnglish (US)
Pages (from-to)666-681
Number of pages16
JournalIEEE Transactions on Signal Processing
Volume66
Issue number3
DOIs
StatePublished - Feb 1 2018

Fingerprint

Feature extraction
Filter banks
Mathematical operators
Visualization
Processing
Costs

Keywords

  • 3D point clouds
  • Contour detection
  • Graph filtering
  • Graph signal processing
  • Registration
  • Sampling
  • Shape modeling
  • Visualization

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Fast resampling of three-dimensional point clouds via graphs. / Chen, Siheng; Tian, Dong; Feng, Chen; Vetro, Anthony; Kovacevic, Jelena.

In: IEEE Transactions on Signal Processing, Vol. 66, No. 3, 01.02.2018, p. 666-681.

Research output: Contribution to journalArticle

Chen, Siheng ; Tian, Dong ; Feng, Chen ; Vetro, Anthony ; Kovacevic, Jelena. / Fast resampling of three-dimensional point clouds via graphs. In: IEEE Transactions on Signal Processing. 2018 ; Vol. 66, No. 3. pp. 666-681.
@article{d0be91d167074dbda820005f2b388c60,
title = "Fast resampling of three-dimensional point clouds via graphs",
abstract = "To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we propose a randomized resampling strategy that selects a representative subset of points while preserving application-dependent features. The 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; by minimizing the error, we obtain a general form of optimal resampling distribution. The proposed resampling distribution is guaranteed to be shift-, rotation- and scale-invariant in the three-dimensional space. We then 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 validate the proposed methods on three applications: Large-scale visualization, accurate registration, and robust shape modeling demonstrating the effectiveness and efficiency of the proposed resampling methods.",
keywords = "3D point clouds, Contour detection, Graph filtering, Graph signal processing, Registration, Sampling, Shape modeling, Visualization",
author = "Siheng Chen and Dong Tian and Chen Feng and Anthony Vetro and Jelena Kovacevic",
year = "2018",
month = "2",
day = "1",
doi = "10.1109/TSP.2017.2771730",
language = "English (US)",
volume = "66",
pages = "666--681",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Fast resampling of three-dimensional point clouds via graphs

AU - Chen, Siheng

AU - Tian, Dong

AU - Feng, Chen

AU - Vetro, Anthony

AU - Kovacevic, Jelena

PY - 2018/2/1

Y1 - 2018/2/1

N2 - To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we propose a randomized resampling strategy that selects a representative subset of points while preserving application-dependent features. The 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; by minimizing the error, we obtain a general form of optimal resampling distribution. The proposed resampling distribution is guaranteed to be shift-, rotation- and scale-invariant in the three-dimensional space. We then 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 validate the proposed methods on three applications: Large-scale visualization, accurate registration, and robust shape modeling demonstrating the effectiveness and efficiency of the proposed resampling methods.

AB - To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we propose a randomized resampling strategy that selects a representative subset of points while preserving application-dependent features. The 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; by minimizing the error, we obtain a general form of optimal resampling distribution. The proposed resampling distribution is guaranteed to be shift-, rotation- and scale-invariant in the three-dimensional space. We then 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 validate the proposed methods on three applications: Large-scale visualization, accurate registration, and robust shape modeling demonstrating the effectiveness and efficiency of the proposed resampling methods.

KW - 3D point clouds

KW - Contour detection

KW - Graph filtering

KW - Graph signal processing

KW - Registration

KW - Sampling

KW - Shape modeling

KW - Visualization

UR - http://www.scopus.com/inward/record.url?scp=85033728697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85033728697&partnerID=8YFLogxK

U2 - 10.1109/TSP.2017.2771730

DO - 10.1109/TSP.2017.2771730

M3 - Article

VL - 66

SP - 666

EP - 681

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 3

ER -