Tree-structured Haar transforms

DOI10.1023/A:1020385811959MaRDI QIDQ1851096zbMATH OpenFDO

Authors Karen Egiazarian, Jaakko Astola

Publication date 15 December 2002

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

zbMATH Keywords

fast algorithmwavelet packetsHaar functionsWalsh transformbinary treeFibonacci treeHaar transform

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• The Haar wavelet transform: its status and achievements
• Properties and some fast algorithms of the Haar transform in image processing and pattern recognition
• scientific article; zbMATH DE number 4069533
• The Haar wavelet transform of a dendrogram
• scientific article; zbMATH DE number 3965959

Cited in

(6)

• Boolean invertible matrices identified from two permutations and their corresponding Haar-type matrices
• Properties and some fast algorithms of the Haar transform in image processing and pattern recognition
• The Haar wavelet transform of a dendrogram
• Superfast wavelet transform using quantics-TT approximation. I: Application to Haar wavelets.
• Joint watermarking and encryption of color images in the Fibonacci-Haar domain
• A class of orthogonal Haar functions constructed on the basis of modified complex Rademacher functions

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)