Accelerated graph-based spectral polynomial filters
arXiv:1509.02468 · doi:10.1109/MLSP.2015.7324315
Abstract
Graph-based spectral denoising is a low-pass filtering using the eigendecomposition of the graph Laplacian matrix of a noisy signal. Polynomial filtering avoids costly computation of the eigendecomposition by projections onto suitable Krylov subspaces. Polynomial filters can be based, e.g., on the bilateral and guided filters. We propose constructing accelerated polynomial filters by running flexible Krylov subspace based linear and eigenvalue solvers such as the Block Locally Optimal Preconditioned Conjugate Gradient (LOBPCG) method.
arXiv comment6 pages, 6 figures. Accepted to the 2015 IEEE International Workshop on Machine Learning for Signal Processing
References in corpus (4)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Acceleration of the shiftable O(1) algorithm for bilateral filtering and non-local means
- Steepest descent and conjugate gradient methods with variable preconditioning
- Chebyshev and Conjugate Gradient Filters for Graph Image Denoising