Abstract
The discrete cosine transform (DCT) is widely applied in various fields including image data compression and was chosen as a basis of International JPEG (Joint Photographic Experts Group) Still Image Compression Standard. All known DCT implementations are sufficiently complicated, because the multiplication operations are making use of. This paper presents a new computational scheme for JPEG baseline system implementation in which the register shifts and additions are used only.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
V.F.Babkin: Method and apparatus for the realization of two-dimensional discrete cosine transform for an 8×8 image fragment. Patent is pending in the USA, Dec. 1991.
C.Loeffer, A.Ligtenberg, S.Moschytz: Practical fast 1-d DCT algorithm with 11 multiplications. Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing 3, D4-2, 988–991 (1989)
H.S.Hou: A fast recursive algorithm for computing the discrete cosine transform. IEEE Trans. Acoust., Speech, Signal Processing ASSP-35, no.10, 1455–1461 (1987)
M.Vetterli, A.Ligtenberg: A discrete Fourier — cosine transform chip. IEEE J. Selected Areas in Commun. SAC-4, no.1, 49–61 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasperovich, L.V., Babkin, V.F. (1993). Fast discrete cosine transform approximation for JPEG image compression. In: Chetverikov, D., Kropatsch, W.G. (eds) Computer Analysis of Images and Patterns. CAIP 1993. Lecture Notes in Computer Science, vol 719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57233-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-57233-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57233-6
Online ISBN: 978-3-540-47980-2
eBook Packages: Springer Book Archive