Image representation and compression with the fractional Fourier transform
275 - 278
Item Usage Stats
We discuss the application of fractional Fourier transform-based filtering configurations to image representation and compression. An image can be approximately represented (and stored or transmitted) as the coefficients of the minimum mean square filtering configuration approximating the image matrix. An order of magnitude compression is possible with moderate errors with the raw method. While inferior to commonly available compression algorithms, the results presented correspond to the basic method without any refinement or combination with other techniques, suggesting that the approach may hold promise for future development. Regardless of its practical usefulness, the fact that the information inherent in an image can be decomposed or factored into fractional Fourier domains is of considerable conceptual significance. The information contained in the image is distributed to the different domains in an unequal way, making some domains more dispensible than others in representing the image. (C) 2001 Published by Elsevier Science B.V.