Fast algorithm for best anisotropic Walsh bases and relatives
Best basis searches through homogeneous trees of isotropic subspaces are widely used in wavelet analysis. In this paper, the author introduces new \(N\log N\) algorithms for computing best anisotropic bases from a library, where \(N\) is the number of samples in an image. First, an anisotropic time domain Walsh algorithm is modified to obtain fast algorithms for computing best anisotropic bases which arise from smoothly segmenting a signal, such as best cosine packet bases. Next, an anisotropic frequency domain Walsh algorithm is modified to allow for the fast computation of various anisotropic best bases which arise from employing filters, such as wavelet packet bases. All of these two-dimensional algorithms are extended to higher dimensions.
- A fast algorithm for adapted time-frequency tilings
- Biorthogonal wavelets for fast matrix computations
- Brushlets: A tool for directional image analysis and image compression
- Entropy-based algorithms for best basis selection
- Fast wavelet transforms and numerical algorithms I
- scientific article; zbMATH DE number 8551 (Why is no real title available?)
- scientific article; zbMATH DE number 712371 (Why is no real title available?)
- Local cosine transform -- A method for the reduction of the blocking effect in JPEG
This page was built for publication: Fast algorithm for best anisotropic Walsh bases and relatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969040)