Fast Haar Transform Algorithms

Authors:
P. R. Roeser;M. E. Jernigan
Affiliations:
Department of Systems Design, Faculty of Engineering, University of Waterloo;-
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 1
Cited 3

Orthogonal Transforms for Digital Signal Processing

Orthogonal Transforms for Digital Signal Processing

Data mining model for atmospheric pollutants from elevated point sources

Proceedings of the 2009 conference on Information Science, Technology and Applications
Fast Haar transform based feature extraction for face representation and recognition

IEEE Transactions on Information Forensics and Security
Dynamic replacement of video coding elements

Image Communication

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this correspondence the implementations of fast Haar transforms are examined. Previous algorithms are described and compared to a new implementation called the in place algorithm. By performing the transform in place and limiting the amount of data movement, the algorithm attains greater memory efficiency and speed than other known algorithms. Index Terms-Efficient algorithm, Haar transform, in place algorithms, orthogonal transforms.