1 July 2003 Performance of parametric slant-Haar transforms
Sos S. Agaian, Khaled Tourshan, Joseph P. Noonan
Author Affiliations +
In general, there is a tradeoff between an orthogonal transform performance and its computational complexity. The Haar transform is by far the fastest of all unitary transforms. The objective of this work is to develop a class of unitary transforms that exhibits computational efficiency as well as good performance utilizing the Haar and slant transforms. This class is called the parametric slant-Haar transforms that includes as special cases the commonly used Haar and slant-Haar transforms. Examples of parametric slant-Haar transforms are given. An efficient fast parametric slant-Haar transform is introduced and its computational complexity is discussed. Relative performance of parametric slant-Haar transforms to that of the Karhunen-Loeve transform (KLT) is discussed. A partially signal dependent parametric slant-Haar transform is also introduced.
©(2003) Society of Photo-Optical Instrumentation Engineers (SPIE)
Sos S. Agaian, Khaled Tourshan, and Joseph P. Noonan "Performance of parametric slant-Haar transforms," Journal of Electronic Imaging 12(3), (1 July 2003). https://doi.org/10.1117/1.1580494
Published: 1 July 2003
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Matrices

Performance modeling

Iterative methods

Data modeling

Image processing

Algorithm development

RELATED CONTENT

Scanline algorithms in compressed domain
Proceedings of SPIE (March 22 1996)
Recent results in wavelet applications
Proceedings of SPIE (March 26 1998)
New method of calculation of reversible integer 1D DCTs
Proceedings of SPIE (March 01 2005)
Parametric Slant-Hadamard transforms
Proceedings of SPIE (May 28 2003)

Back to Top