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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rao, K. R., Yip, P.: Discrete Cosine Transform. Academic Press, San Diego, 1990.
Wallace, G. K.: The JPEG still picture compression standard. //Communications of the ACM, Vol. 34,No 4, pp. 31–44, 1991.
Krupiczka, A.: Interblock variance as a segmentation criterion in image coding. //Mashine Graphics and Vision, Vol. 5,Nos 1/2, pp. 229–235, 1996
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, 1992
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, 1992
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.
Feig, E., Ben-Or, M.: On algebras related to the discrete cosine transform. //Linear Algebra and Its Applications, Vol. 266, pp. 81–106, 1997
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, 1997
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, 1997
Jacobson, N.: Structure and representation of Jordan algebras. Providense, R.I., 1968
Nussbaumer, H. J.: Fast Fourier transform and convolution algorithms. Springer Verlag, 1971.
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, 1992
Pratt, W. K.: Digital Image Processing, Vol.2. A Wiley-Interscience Publication, New York, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chichyeva, M.A., Chernov, V.M. (1999). Image Block Coding Based on New Algorithms of Short-Length DCT with Minimal Multiplicative Complexity. In: Solina, F., Leonardis, A. (eds) Computer Analysis of Images and Patterns. CAIP 1999. Lecture Notes in Computer Science, vol 1689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48375-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-48375-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66366-9
Online ISBN: 978-3-540-48375-5
eBook Packages: Springer Book Archive