Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43706 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- A unifying approach to some old and new theorems on distribution and clustering
- An introduction to support vector machines and other kernel-based learning methods.
- Bilateral Filtering: Theory and Applications
- Compressive Bilateral Filtering
- Fast $O(1)$ Bilateral Filtering Using Trigonometric Range Kernels
- Fast Bilateral Filter With Arbitrary Range and Domain Kernels
- Fast and Provably Accurate Bilateral Filtering
- Fast approximation of the discrete Gauss transform in higher dimensions
- Introduction to robust and quasi-robust statistical methods
- Low rank approximation. Algorithms, implementation, applications
- Pattern recognition and machine learning.
- Spectra of multilevel Toeplitz matrices: Advanced theory via simple matrix relationships
- Spectral Properties of Banded Toeplitz Matrices
- The Fast Gauss Transform
- The Guided Bilateral Filter: When the Joint/Cross Bilateral Filter Becomes Robust
- The elements of statistical learning. Data mining, inference, and prediction
- Toeplitz and circulant matrices: a review.
Cited in
(3)
This page was built for publication: Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799653)