HADAMARD TRANSFORM IMAGE CODING
HADAMARD TRANSFORM IMAGE CODING
复制标题
DOI：
10.1109/proc.1969.6869
复制
发表时间：
1969-01-01
影响因子：
20.6
通讯作者：
ANDREWS, HC
中科院分区：
文献类型：
--
作者：
PRATT, WK;KANE, J;ANDREWS, HC
快速傅立叶变换算法的引入导致了傅立叶变换图像编码技术的发展，由此图像的二维傅立叶变换在信道上传输，而不是图像本身。这种发展还导致了相关的图像编码技术，其中图像由Hadamard矩阵算子变换。阿达玛矩阵是一个正方形阵列的正和负的行和列是相互正交的。已经开发了一种类似于快速傅立叶变换算法的高速计算算法，该算法执行Hadamard变换。由于Hadamard变换只需要真实的数的加法和减法，与复数傅立叶变换相比，可能具有数量级的速度优势。传输图像的阿达玛变换而不是图像的空间表示提供了对信道错误的潜在容忍度以及减少带宽传输的可能性。
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.