Impact of signal-to-noise ratio and bandwidth on graph Laplacian spectrum from high-dimensional noisy point cloud

• URL: http://arxiv.org/abs/2011.10725v3
• Date: Sun, 17 Jul 2022 12:58:45 GMT
• Title: Impact of signal-to-noise ratio and bandwidth on graph Laplacian spectrum from high-dimensional noisy point cloud
• Authors: Xiucai Ding and Hau-Tieng Wu
• Abstract summary: We study the spectrum of kernel-based graph Laplacian constructed from high-dimensional and noisy random point cloud. We quantify how the signal and noise interact over different regimes of signal-to-noise ratio (SNR)
• Score: 8.680676599607125
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We systematically {study the spectrum} of kernel-based graph Laplacian (GL) constructed from high-dimensional and noisy random point cloud in the nonnull setup, where the point cloud is sampled from a low-dimensional geometric object, like a manifold, and corrupted by high-dimensional noise. We quantify how the signal and noise interact over different regimes of signal-to-noise ratio (SNR), and report {the resulting peculiar spectral behavior} of GL. In addition, we explore the choice of kernel bandwidth on the spectrum of GL over different regimes of SNR, which leads to an adaptive choice of bandwidth that coincides with the common practice in real data. This result provides a theoretical support for what practitioner do when the dataset is noisy.

Related papers

• Hyperspectral Band Selection based on Generalized 3DTV and Tensor CUR Decomposition [8.812294191190896]
  Hyperspectral Imaging serves as an important technique in remote sensing. High dimensionality and data volume pose significant computational challenges. We propose a novel hyperspectral band selection model by decomposing the data into a low-rank and smooth component and a sparse one.
  arXiv  Detail & Related papers  (2024-05-02T02:23:38Z)
• Bayesian Formulations for Graph Spectral Denoising [9.086602432203417]
  We consider the problem of denoising features associated to complex data, modeled as signals on a graph, via a smoothness prior. We present algorithms for the cases where the signal is perturbed by Gaussian noise, dropout, and uniformly distributed noise. We demonstrate the algorithms' ability to effectively restore signals from white noise on image data and from severe dropout in single-cell RNA sequence data.
  arXiv  Detail & Related papers  (2023-11-27T23:53:19Z)
• How do kernel-based sensor fusion algorithms behave under high dimensional noise? [9.13755431537592]
  We study the behavior of two kernel based sensor fusion algorithms, NCCA and alternating diffusion (AD) We show that if NCCA and AD are directly applied to the noisy point clouds without any sanity check, it may generate artificial information that misleads scientists' interpretation. On the other hand, we prove that if the bandwidths are selected adequately, both NCCA and AD can be made robust to high dimensional noise when the SNRs are relatively large.
  arXiv  Detail & Related papers  (2021-11-22T01:42:28Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Lattice partition recovery with dyadic CART [79.96359947166592]
  We study piece-wise constant signals corrupted by additive Gaussian noise over a $d$-dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks of signal detection or testing, de-noising and estimation have been studied extensively in the statistical and signal processing literature. In this paper we consider instead the problem of partition recovery, i.e.of estimating the partition of the lattice induced by the constancy regions of the unknown signal. We prove that a DCART-based procedure consistently estimates the underlying partition at a rate of order $sigma2 k*
  arXiv  Detail & Related papers  (2021-05-27T23:41:01Z)
• Deep Networks for Direction-of-Arrival Estimation in Low SNR [89.45026632977456]
  We introduce a Convolutional Neural Network (CNN) that is trained from mutli-channel data of the true array manifold matrix. We train a CNN in the low-SNR regime to predict DoAs across all SNRs. Our robust solution can be applied in several fields, ranging from wireless array sensors to acoustic microphones or sonars.
  arXiv  Detail & Related papers  (2020-11-17T12:52:18Z)
• Conditioning Trick for Training Stable GANs [70.15099665710336]
  We propose a conditioning trick, called difference departure from normality, applied on the generator network in response to instability issues during GAN training. We force the generator to get closer to the departure from normality function of real samples computed in the spectral domain of Schur decomposition.
  arXiv  Detail & Related papers  (2020-10-12T16:50:22Z)
• Improving Stability of LS-GANs for Audio and Speech Signals [70.15099665710336]
  We show that encoding departure from normality computed in this vector space into the generator optimization formulation helps to craft more comprehensive spectrograms. We demonstrate the effectiveness of binding this metric for enhancing stability in training with less mode collapse compared to baseline GANs.
  arXiv  Detail & Related papers  (2020-08-12T17:41:25Z)
• Learning Graph-Convolutional Representations for Point Cloud Denoising [31.557988478764997]
  We propose a deep neural network that can deal with the permutation-invariance problem encountered by learning-based point cloud processing methods. The network is fully-convolutional and can build complex hierarchies of features by dynamically constructing neighborhood graphs. It is especially robust both at high noise levels and in presence of structured noise such as the one encountered in real LiDAR scans.
  arXiv  Detail & Related papers  (2020-07-06T08:11:28Z)
• Hyperspectral Image Denoising with Partially Orthogonal Matrix Vector Tensor Factorization [42.56231647066719]
  Hyperspectral image (HSI) has some advantages over natural image for various applications due to the extra spectral information. During the acquisition, it is often contaminated by severe noises including Gaussian noise, impulse noise, deadlines, and stripes. We present a HSI restoration method named smooth and robust low rank tensor recovery.
  arXiv  Detail & Related papers  (2020-06-29T02:10:07Z)
• Shape Matters: Understanding the Implicit Bias of the Noise Covariance [76.54300276636982]
  Noise in gradient descent provides a crucial implicit regularization effect for training over parameterized models. We show that parameter-dependent noise -- induced by mini-batches or label perturbation -- is far more effective than Gaussian noise. Our analysis reveals that parameter-dependent noise introduces a bias towards local minima with smaller noise variance, whereas spherical Gaussian noise does not.
  arXiv  Detail & Related papers  (2020-06-15T18:31:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.