Investigations of several discrete transform methods for image processing applications
Abstract
Several discrete transform methods, including the KL and FFT, have been compared in order to determine their relative utility in an image processing environment. Computational requirements (both memory size and execution time), mean-squared error, and also subjective factors have been included in this study. In addition, the effect of sectioning an image into sub-blocks has been investigated. Results should be useful in the design and implementation of an image data compression system.
- Publication:
-
SOUTHEASTCON 1981; Proceedings of the Region 3 Conference and Exhibit
- Pub Date:
- 1981
- Bibcode:
- 1981ieee.conf..881Q
- Keywords:
-
- Data Compression;
- Discrete Functions;
- Fast Fourier Transformations;
- Image Processing;
- Karhunen-Loeve Expansion;
- Algorithms;
- Eigenvalues;
- Image Rotation;
- Root-Mean-Square Errors;
- Instrumentation and Photography