Advertisement

Image Block Coding Based on New Algorithms of Short-Length DCT with Minimal Multiplicative Complexity

  • Marina A. Chichyeva
  • Vladimir M. Chernov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1689)

Abstract

A quality of block coding algorithms based on the DCT with use of NxN-blocks (8≤N<16) is researched in the paper. A time of the image compression does not increase at increasing of block size. It is achieved due to decrease of computational complexity by means of a new approach to synthesis of the short-length DCT algorithms. This approach is connected to interpretation of the DCT calculation as operations in associated algebraic structures.

Keywords

Discrete Cosine Transform Block Code Variable Element Real Multiplication Inverse Discrete Cosine Transform 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rao, K. R., Yip, P.: Discrete Cosine Transform. Academic Press, San Diego, 1990.zbMATHGoogle Scholar
  2. 2.
    Wallace, G. K.: The JPEG still picture compression standard. //Communications of the ACM, Vol. 34,No 4, pp. 31–44, 1991.CrossRefGoogle Scholar
  3. 3.
    Krupiczka, A.: Interblock variance as a segmentation criterion in image coding. //Mashine Graphics and Vision, Vol. 5,Nos 1/2, pp. 229–235, 1996Google Scholar
  4. 4.
    Chan-Wan, Y.-H., Siu, C.: On the realization of discrete cosine transform using the distributed arithmetic. //IEEE Transactions on Circuits and Systems — I: Fundamental Theory and Applications, Vol. 39,No 9, pp. 705–712, 1992CrossRefGoogle Scholar
  5. 5.
    Hou, H. S., Tretter, D. K.: Interesting properties of the discrete cosine transform. //J. Visual Commun. and Image Represent., Vol. 3,No 1, pp. 73–83, 1992CrossRefGoogle Scholar
  6. 6.
    Duhamel, P.: Implementation of split-radix FFT algorithms for complex, real, and real-symmetric data. //IEEE Trans. Accoust., Speech, and Signal Process., 1984, Vol.32,No 4, pp.750–761.CrossRefGoogle Scholar
  7. 7.
    Feig, E., Ben-Or, M.: On algebras related to the discrete cosine transform. //Linear Algebra and Its Applications, Vol. 266, pp. 81–106, 1997zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Bazensky, G., Tasche, M.: Fast polynomial multiplication and convolutions related to the discrete cosine transform. //Linear Algebra and Its Applications, Vol. 252,Issue 1–3, pp. 1–25, 1997CrossRefMathSciNetGoogle Scholar
  9. 9.
    Chichyeva, M. A., Chernov, V. M.: “One-step” short-length DCT algorithms with data representation in the direct sum of associative algebras. //Proceedings CAIP'97, Springer, LNCS 1296, pp.590–596, 1997Google Scholar
  10. 10.
    Jacobson, N.: Structure and representation of Jordan algebras. Providense, R.I., 1968Google Scholar
  11. 11.
    Nussbaumer, H. J.: Fast Fourier transform and convolution algorithms. Springer Verlag, 1971.Google Scholar
  12. 12.
    Chan, S.-C., Ho, K.-L.: Fast algorithms for computing the discrete cosine transform. //IEEE Trans. on Circuits and Systems, Vol. 39,No 3, pp.185–190, 1992zbMATHCrossRefGoogle Scholar
  13. 13.
    Pratt, W. K.: Digital Image Processing, Vol.2. A Wiley-Interscience Publication, New York, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Marina A. Chichyeva
    • 1
  • Vladimir M. Chernov
    • 1
  1. 1.Image Processing System Institute of RASSamaraRussia

Personalised recommendations