3D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Model
3D point cloud - a new signal representation of volumetric objects - is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud - e.g., stereo-matching from multiple viewpoint images or depth data acquired directly from active light sensors - imply non-negligible noise in the data. In this paper, we adopt a previously proposed low-dimensional manifold model for the surface patches in the point cloud and seek self-similar patches to denoise them simultaneously using the patch manifold prior. Due to discrete observations of the patches on the manifold, we approximate the manifold dimension computation defined in the continuous domain with a patch-based graph Laplacian regularizer and propose a new discrete patch distance measure to quantify the similarity between two same-sized surface patches for graph construction that is robust to noise. We show that our graph Laplacian regularizer has a natural graph spectral interpretation, and has desirable numerical stability properties via eigenanalysis. Extensive simulation results show that our proposed denoising scheme can outperform state-of-the-art methods in objective metrics and can better preserve visually salient structural features like edges.
Code (0)
등록된 구현이 없습니다.
Tasks
Denoisinggraph constructionStereo MatchingStereo Matching HandSimilar Papers 제목 키워드 기반
Hypergraph $p$-Laplacian regularization on point clouds for data interpolation
As a generalization of graphs, hypergraphs are widely used to model higher-order relations in data. This paper explores the benefit of the hypergraph structure for the interpolation of point cloud data that contain no ex…
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
Inverse imaging problems are inherently under-determined, and hence it is important to employ appropriate image priors for regularization. One recent popular prior---the graph Laplacian regularizer---assumes that the tar…
DenoisingImage Denoising3D Dynamic Point Cloud Denoising via Spatial-Temporal Graph Learning
The prevalence of accessible depth sensing and 3D laser scanning techniques has enabled the convenient acquisition of 3D dynamic point clouds, which provide efficient representation of arbitrarily-shaped objects in motio…
Denoisinggraph constructionGraph Learning3D Point Cloud Denoising via Bipartite Graph Approximation and Reweighted Graph Laplacian
Point cloud is a collection of 3D coordinates that are discrete geometric samples of an object's 2D surfaces. Imperfection in the acquisition process means that point clouds are often corrupted with noise. Building on re…
DenoisingAnalysis of Semi-Supervised Learning on Hypergraphs
Hypergraphs provide a natural framework for modeling multiway interactions. We analyze a class of variational semi-supervised learning problems posed on random geometric hypergraphs and establish asymptotic consistency i…