Hadamard transform image coding

The introduction of the fast Fourier transform algorithm has led to the development of the Fourier transform image coding technique whereby the two-dimensional Fourier transform of an image is transmitted over a channel rather than the image itself. This devlopement has further led to a related image coding technique in which an image is transformed by a Hadamard matrix operator. The Hadamard matrix is a square array of plus and minus ones whose rows and columns are orthogonal to one another. A high-speed computational algorithm, similar to the fast Fourier transform algorithm, which performs the Hadamard transformation has been developed. Since only real number additions and subtractions are required with the Hadamard transform, an order of magnitude speed advantage is possible compared to the complex number Fourier transform. Transmitting the Hadamard transform of an image rather than the spatial representation of the image provides a potential toleration to channel errors and the possibility of reduced bandwidth transmission.

[1]  H. Rademacher,et al.  Einige Sätze über Reihen von allgemeinen Orthogonalfunktionen , 1922 .

[2]  J. Walsh A Closed Set of Normal Orthogonal Functions , 1923 .

[3]  R. Paley On Orthogonal Matrices , 1933 .

[4]  J. Williamson Hadamard’s determinant theorem and the sum of four squares , 1944 .

[5]  N. Fine On the Walsh functions , 1949 .

[6]  N. J. Fine,et al.  The generalized Walsh functions , 1950 .

[7]  George W. Morgenthaler,et al.  On Walsh-Fourier series , 1957 .

[8]  F. Yates Design and Analysis of Factorial Experiments , 1958 .

[9]  Irving John Good,et al.  The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[10]  L. D. Baumert,et al.  Discovery of an Hadamard matrix of order 92 , 1962 .

[11]  A. Papoulis,et al.  The Fourier Integral and Its Applications , 1963 .

[12]  Keith W. Henderson,et al.  Some Notes on the Walsh Functions , 1964, IEEE Trans. Electron. Comput..

[13]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[14]  C. M. Rader,et al.  Efficient coding of vocoder channel signals using linear transformation , 1966 .

[15]  Peter D. Welch,et al.  Historical notes on the fast Fourier transform , 1967 .

[16]  W. Morven Gentleman,et al.  Matrix multiplication and fast fourier transforms , 1968 .

[17]  William K. Pratt,et al.  Television bandwidth reduction by encoding spatial frequencies. , 1968 .

[18]  Harry Andrews,et al.  A High-Speed Algorithm for the Computer Generation of Fourier Transforms , 1968, IEEE Transactions on Computers.

[19]  Henning F. Harmuth,et al.  A generalized concept of frequency and some applications , 1968, IEEE Trans. Inf. Theory.

[20]  H. C. Andrews Entropy considerations in the frequency domain , 1968 .