Paper
8 May 2001 Adaptive Haar transforms with arbitrary time and scale splitting
Author Affiliations +
Proceedings Volume 4304, Nonlinear Image Processing and Pattern Analysis XII; (2001) https://doi.org/10.1117/12.424979
Event: Photonics West 2001 - Electronic Imaging, 2001, San Jose, CA, United States
Abstract
The Haar transform is generalized to the case of an arbitrary time and scale splitting. To any binary tree we associate an orthogonal system of Haar-type functions - tree-structured Haar (TSH) functions. Unified fast algorithm for computation of the introduced tree-structured Haar transforms is presented. It requires 2(N - 1) additions and 3N - 2 multiplications, where N is transform order or, equivalently, the number of leaves of the binary tree.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Karen O. Egiazarian and Jaakko T. Astola "Adaptive Haar transforms with arbitrary time and scale splitting", Proc. SPIE 4304, Nonlinear Image Processing and Pattern Analysis XII, (8 May 2001); https://doi.org/10.1117/12.424979
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Matrices

Algorithm development

Wavelets

Signal processing

Telecommunications

Communication theory

RELATED CONTENT

Super-fast Fourier transform
Proceedings of SPIE (February 16 2006)
Wavelets and signal processing
Proceedings of SPIE (March 22 1996)
Fast approximate Fourier transform via wavelets transform
Proceedings of SPIE (October 23 1996)
New method of calculation of reversible integer 1D DCTs
Proceedings of SPIE (March 01 2005)

Back to Top