An Adaptive Fast Transform Based Image Compression

  • Kamil Stokfiszewski
  • Piotr S. Szczepaniak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5097)


The paper deals with image compression performed using an adaptive fast transform-based method. The point of departure is a base scheme for fast computation of certain discrete transforms. The scheme can be interpreted in terms of the neural architecture whose parameters (neurons’ weights) can be adjusted during learning on set data, here images. The same basic network topology enables realization of diverse transformations. The results obtained for the task of image compression are presented and evaluated.


Discrete Cosine Transform Discrete Fourier Transform Training Image Image Compression Inverse Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nelson, M., Gailly, J.: The Data Compression Book. M&A Books, New York (1996)Google Scholar
  2. 2.
    Pennebacker, W.B., Mitchell, J.L.: JPEG Still Image Data Compression Standard. Van Nostrand Reinhold, New York (1993)Google Scholar
  3. 3.
    Sayood, K.: Introduction to Data Compression. Morgan Kaufmann, San Francisco (2000)Google Scholar
  4. 4.
    Jacymirski, M.M.: Fast Algorithms for Orthogonal Trigonometric Transformations. Academic Express, Lviv, no. 219, Ukraine (in Ukrainian) (1997)Google Scholar
  5. 5.
    Jacymirski, M., Szczepaniak, P.S.: Neural Realization of Fast Linear Filters. In: Proc. of 4th EURASIP-IEEE Region & International Symposium on Video/Image Processing and Multimedia Communications, Zadar, Croatia, pp. 153–157 (2002)Google Scholar
  6. 6.
    Lu, F.-L., Unbehauen, R.: Applied Neural Networks for Signal Processing. Cambridge University Press, Cambridge (1998)Google Scholar
  7. 7.
    Bracewell, R.N.: The Hartley Transform. Oxford University Press, New York (1986)zbMATHGoogle Scholar
  8. 8.
    Wang, Z.: Fast Algorithms for the Discrete W Transform and for the Discrete Fourier Transform. IEEE Trans. ASSP 32(4), 803–816 (1984)zbMATHCrossRefGoogle Scholar
  9. 9.
    Jacymirski, M., Wiechno, T.: A Novel Method of Building Fast Fourier Transform Algorithms. In: Proceedings of the International Conference on Signals and Electronic Systems (ICSES 2001), Lodz, Poland, September 18-21, 2001, pp. 415–422 (2001)Google Scholar
  10. 10.
    Osowski, S:: Algorithmic Approach to Neural Networks, Wydawnictwa Naukowo-Techniczne, Warszawa (in Polish) (1996) ISBN 83-204-2197-7Google Scholar
  11. 11.
    Ahmed, U.N., Rao, K.R.: Orthogonal Transforms for Digital Signal Processing. Springer, New York (1975)zbMATHGoogle Scholar
  12. 12.
    Rao, K.R., Yip, P.: Discrete cosine transform: algorithms, advantages, applications. Academic Press Professional, San Diego (1990)zbMATHGoogle Scholar
  13. 13.
    Ahmed, N., Natarajan, T., Rao, K.R.: Discrete Cosine Transform. IEEE Transactions on Computers, 90–93 (1974)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Kamil Stokfiszewski
    • 1
  • Piotr S. Szczepaniak
    • 1
    • 2
  1. 1.Institute of Computer ScienceTechnical University of LodzLodzPoland
  2. 2.Systems Research InstitutePolish Academy of SciencesWarsawPoland

Personalised recommendations