Abstract
The Discrete Cosine Transform is widely used in the field of still image compression. Many integer approximations are given in the literature whereas the most of these transforms requires bit shift operations. This paper presents an efficient and low complexity integer approximation of the DCT for image compression. Our new approach involves replacing the bit shift elements of a variant of the Signed DCT transform by zeros, in order to eliminate the bit shift operations. As a result, all elements of the proposed transform are zeros and ± 1. Indeed, the proposed transform retains all the characteristics of its original transform, such as orthogonality and high energy compaction capabilities, while generating computing cost savings. Experiments show that the proposed transform has a good compromise performance-computational complexity as well as state-of the-art DCT approximations. Moreover, an efficient algorithm primarily involving a small amount of arithmetical computation is well developed as no multiplications and bit-shift operations are required, with only 16 additions being involved.
Similar content being viewed by others
References
Ahmed N, Natarajan T, Rao KR (1974) Discrete cosine transform [J]. IEEE Trans Comput 23(1):90–93
Almurib AFH, Kumar TN, Lombardi F (2018) Approximate DCT image compression using inexact computing [J]. IEEE Trans Comput 67(2):149–159
Bouguezel S, Ahmed MO, Swamy MNS (2008) Low complexity 8×8 transform for image compression [J]. Electron Lett 44(21):1249–1250
Bouguezel S, Ahmed MO, Swamy MNS (2011) A low–complexity parametric transform for image compression. [C]// proceeding of IEEE international symposium of circuits and systems (ISCAS): p 2145-2148
Bouguezel S, Ahmed MO, Swamy MNS (2013) Binary discrete cosine and Hartley transforms [J]. IEEE Trans Circ and Syst I 60(4):989–100
Brahimi N, Bouguezel S (2011) An efficient fast integer DCT transform for images compression with 16 additions only[C]//proceeding of 7th international workshop on systems signal processing and their applications (WOSSPA), p 71–74.
Brahimi T, Melit A, Khelifi F (2009) An improved SPIHT algorithm for lossless image coding [J]. Digital Signal Processing 19(2):220–228
Brahimi T, Boubchir L, Fournier R, Nait-Ali A (2017) An improved multimodal signal image compression scheme with application to natural images and biomedical data [J]. Multimed Tools Appl 76(15):16783–16805
Brahimi T, Laouir F, Boubchir L, Ali-Chérif A (2017) An improved wavelet-based image coder for embedded greyscale and colour image compression [J]. AEU Int J Electron Commun 73:183–192
Cintra RJ, Bayer FM (2011) A DCT approximation for image compression [J]. IEEE Signal Proc Lett 18(10):579–582
Cintra RJ, Bayer FM (2012) DCT-like transform for image compression requires 14 additions only [J]. Electron Lett 48(15):919–921
Coelho DFG, Cintra RJ, Kulasekera S, Madanayake A, Dimitrov VS (2016) Error-free computation of 8-point discrete cosine transform based on the Loeffler factorization and algebraic integers [J]. IET Signal Proc 10(6):633–640
Ezhilarasi R, Venkatalakshmi K, Khanth BP (2018) Enhanced approximate discrete cosine transforms for image compression and multimedia applications [J]. Multimed Tools Appl:1–14
Haweel TI (2001) A new square wave transform based on the DCT [J]. Signal Process 81(11):2309–2319
Haweel RH, El-Kilani WS, Ramadan HH (2016) Fast approximate DCT with GPU implementation for image compression [J]. J Vis Commun Image Represent 40:357–365
Jridi M, Alfalou A, Meher PK (2015) A generalized algorithm and reconfigurable architecture for efficient and scalable orthogonal approximation of DCT [J]. IEEE Trans Circ and Syst I 62(2):449–457
Lee MH, Kaveh M (1986) Fast Hadamard transform based on a simple matrix factorization [J]. IEEE Trans Acoust Speech Signal Process 34(6):1666–1667
Liu S, Yu R, Huang H, Yang H (2014) Unified algorithms for computation of different points integer 1-D DCT/IDCT for the HEVC standard [C]// International Conference on Software Intelligence Technologies and Applications & International Conference on Frontiers of Internet of Things p. 207–211
Miano J (1999) Compressed image file formats JPEG, PNG, GIF, XBM, BMP. Addison Wesley Longman
Oliveira RS, Cintra RJ et al (2019) Low-complexity 8-point DCT approximation based on angle similarity for image and video coding [J]. Multidim Syst Sign Process 30(3):1363–1394
Potlur U, Madanayake A, Cintra R, Bayer F, Kulasekera S, Edirisuriya A (2014) Improved 8-point approximate DCT for image and video compression requiring only 14 additions [J]. IEEE Trans Circ and Syst 61(6):1727–1740
Rao KR, Kim DN, Hwang JJ (2014) Video coding standards. The Netherlands Springer:51–97
Rao K, Ramamohan K, Yip P (2014) Discrete cosine transform: algorithms, advantages, applications. Academic Press
Sayood K (2017) Introduction to data compression. Morgan Kaufmann, Elsevier
Senapati RK, Pati UC, Mahapatra KK (2010) A low complexity orthogonal 8×8 transform matrix for fast image compression [C]// proceeding of annual IEEE India conference (INCICON): 1-4
Tamboli P, Shinde A (2015) A low complexity 8 × 8 DCT transform for image compression [J]. IJAREEIE 4(7):6185–6190
Wahid KA, Dimitrov VS, Jullien GA (2007) On the error-free realization of a scaled DCT algorithm and its VLSI implementation [J]. IEEE Trans Circ and Syst II. Express Briefs 54(8):700–704
Wallace GK (1992) The JPEG still picture compression standard [J]. IEEE Trans Consum Electron 38(1):xviii–xxxiv
Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity [J]. IEEE Trans Image Process 13(4):600–612
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Brahimi, N., Bouden, T., Brahimi, T. et al. A novel and efficient 8-point DCT approximation for image compression. Multimed Tools Appl 79, 7615–7631 (2020). https://doi.org/10.1007/s11042-019-08325-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-019-08325-2