Tree-structured Haar transforms
From MaRDI portal
Classical Haar functions are defined by the dyadic splitting of the interval. In this paper, the authors generalize the idea to an arbitrary time and scale splitting. To a given binary tree is associated an orthogonal system of Haar-type functions, which are called tree-structured Haar functions (TSH). A general background is introduced to design fast TSH transforms. The authors show that the algorithm requires \(2(N-1)\) additions and \(3N-2\) multiplications, where \(N\) designates the number of leaves of the binary tree.
Recommendations
Cited in
(7)- Boolean invertible matrices identified from two permutations and their corresponding Haar-type matrices
- The Haar wavelet transform of a dendrogram
- Properties and some fast algorithms of the Haar transform in image processing and pattern recognition
- scientific article; zbMATH DE number 1200161 (Why is no real title available?)
- Superfast wavelet transform using quantics-TT approximation. I: Application to Haar wavelets.
- A class of orthogonal Haar functions constructed on the basis of modified complex Rademacher functions
- Joint watermarking and encryption of color images in the Fibonacci-Haar domain
This page was built for publication: Tree-structured Haar transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1851096)