Properties of Laplacian Pyramids for Extension and Denoising
arXiv:1909.07974
Abstract
We analyze the Laplacian pyramids algorithm of Rabin and Coifman for extending and denoising a function sampled on a discrete set of points. We provide mild conditions under which the algorithm converges, and prove stability bounds on the extended function. We also consider the iterative application of truncated Laplacian pyramids kernels for denoising signals by non-local means.
References in corpus (5)
- Reduced models in chemical kinetics via nonlinear data-mining
- Nonlinear Intrinsic Variables and State Reconstruction in Multiscale Simulations
- Predicting regional and pan-Arctic sea ice anomalies with kernel analog forecasting
- PCA-Based Out-of-Sample Extension for Dimensionality Reduction
- Auto-adaptative Laplacian Pyramids for High-dimensional Data Analysis