Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
From MaRDI portal
Publication:1799653
DOI10.1007/s10851-018-0804-2zbMath1437.62243OpenAlexW2790257137MaRDI QIDQ1799653
Guang Deng, Jonathan H. Manton, Wang, Song
Publication date: 19 October 2018
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-018-0804-2
Image analysis in multivariate analysis (62H35) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Eigenvalues, singular values, and eigenvectors (15A18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to robust and quasi-robust statistical methods
- Low rank approximation. Algorithms, implementation, applications
- Spectra of multilevel Toeplitz matrices: Advanced theory via simple matrix relationships
- A unifying approach to some old and new theorems on distribution and clustering
- Fast approximation of the discrete Gauss transform in higher dimensions
- Bilateral Filtering: Theory and Applications
- Fast $O(1)$ Bilateral Filtering Using Trigonometric Range Kernels
- The Guided Bilateral Filter: When the Joint/Cross Bilateral Filter Becomes Robust
- Compressive Bilateral Filtering
- Fast and Provably Accurate Bilateral Filtering
- Fast Bilateral Filter With Arbitrary Range and Domain Kernels
- Spectral Properties of Banded Toeplitz Matrices
- The Fast Gauss Transform
- The elements of statistical learning. Data mining, inference, and prediction