Properties and some fast algorithms of the Haar transform in image processing and pattern recognition

Authors:
P.C Mali;B.B Chaudhuri;D Dutta Majumder
Affiliations:
Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta 700 035, India;Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta 700 035, India;Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta 700 035, India
Venue:
Pattern Recognition Letters
Year:
1984

Citing 4
Cited 1

Orthogonal Transforms for Digital Signal Processing

Orthogonal Transforms for Digital Signal Processing
Discrete Cosine Transfom

IEEE Transactions on Computers
A Sinusoidal Family of Unitary Transforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance bound of Walsh-Hadamard transform for feature selection and compression and some related fast algorithms

Pattern Recognition Letters

A sub-block-based eigenphases algorithm with optimum sub-block size

Knowledge-Based Systems

Quantified Score

Hi-index	0.10

Visualization

Abstract

Properties of the Haar transform in image processing and pattern recognition are investigated. A lower bound of the performance of the Haar transform relative to that of the Karhunen-Loeve transform for first-order Markov processes is found. It is proved that the Haar transform is inferior to the Walsh-Hadamard transform for such processes. A unique condition is presented which, if satisfied by the elements of a matrix, will make the Karhunen-Loeve transform of the matrix and the Haar transform equivalent. Some fast algorithms are given to realize the diagonal elements of a Haar transformed matrix.