Published on Sat Apr 06 2019

Local Regularization of Noisy Point Clouds: Improved Global Geometric Estimates and Data Analysis

Nicolas Garcia Trillos, Daniel Sanz-Alonso, Ruiyi Yang

Data analysis techniques employ similarity relationships between data points to uncover the intrinsic dimension and geometric structure of the underlying data-generating mechanism. Using a local regularization of the noisy data to define the similarity improves the approximation of the hidden Euclidean distance between points.

0
0
0
Abstract

Several data analysis techniques employ similarity relationships between data points to uncover the intrinsic dimension and geometric structure of the underlying data-generating mechanism. In this paper we work under the model assumption that the data is made of random perturbations of feature vectors lying on a low-dimensional manifold. We study two questions: how to define the similarity relationship over noisy data points, and what is the resulting impact of the choice of similarity in the extraction of global geometric information from the underlying manifold. We provide concrete mathematical evidence that using a local regularization of the noisy data to define the similarity improves the approximation of the hidden Euclidean distance between unperturbed points. Furthermore, graph-based objects constructed with the locally regularized similarity function satisfy better error bounds in their recovery of global geometric ones. Our theory is supported by numerical experiments that demonstrate that the gain in geometric understanding facilitated by local regularization translates into a gain in classification accuracy in simulated and real data.

Tue Mar 20 2018
Computer Vision
3D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Model
3D point cloud is a new signal representation of volumetric objects. Conventional imperfect acquisition processes imply non-negligible noise in the data. We adopt a previously proposed low-dimensional manifold model for the point cloud.
0
0
0
Mon Nov 16 2015
Computer Vision
Graph-based denoising for time-varying point clouds
Noisy 3D point clouds arise in many applications. They may be due to errors when constructing a 3D model from images or simply to imprecise depth sensors.
0
0
0
Wed Jun 01 2016
Machine Learning
Finding Singular Features
We present a method for finding high density, low-dimensional structures in noisy point clouds. These structures are sets with zero Lebesgue measure with respect to the -dimensional ambient space. We call them "singular features"
0
0
0
Sat Mar 13 2021
Machine Learning
Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud data
0
0
0
Wed Jun 12 2019
Machine Learning
Structure-adaptive manifold estimation
We consider a problem of manifold estimation from noisy observations. Many learning procedures locally approximate a manifold by a weighted average over a small neighborhood. In the presence of large noise, the assigned weights become corrupted. We suggest a novel computationally efficient structure-adaptive procedure.
0
0
0
Sat Aug 08 2015
Machine Learning
A variational approach to the consistency of spectral clustering
This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground truth measure. We investigate the spectral convergence of both unnormalized and normalized graph Laplacians.
0
0
0