Date of Publication :7th April 2016
Abstract: DCT has a fundamental role in signal processing techniques and is a part of modern image and video compression standards. The major difficulties encountered in compressed DCT domain are computational complexity of image compression and decompression algorithms. Distributed algorithm is a fast algorithm that can perform these tasks directly in the transform domain. Low-complexity DCT approximations employs distributed algorithm and hence it is best preferred for image and video compression. Approximate DCT have some of the disadvantages likes having only adder circuits for operations, more number of gates during implementation and high delay. Modified approximate DCT is an approximate DCT which uses efficient binary adders. Advantages of efficient binary adders include reduction in number of gate counts and logic implementation which reduce clock cycles and power consumption. By using DCT coefficients, histogram based block optimization and arithmetic coding is designed for efficient image compression. This technique is designed within the MATLAB environment and routed to FPGA device.
Reference :
-
[1] Uma Sadhvi Potluri, Arjuna Madanayake, Member, IEEE, Renato J. Cintra, Senior Member, IEEE, FbioM. Bayer,Sunera Kulasekera, and Amila Edirisuriya,”Improved 8-Point Approximate DCT for Image and Video Compression Requiring Only 14 Additions,” IEEE Transactions On Circuits And Systems, Vol. 61, No. 6,pp. 1727-1740 ,June 2014.
[2] D. Jeyalakshmi and T. Bernatin Department of Electronics and Telecommunication Engineering, Sathya bama University, Chennai, India,” Modified Approximate DCT For Image Compression Using Efficient Binary Adder,” ” ISSN 1819-6608 ARPN Journal of Engineering and Applied Sciences, VOL. 10, NO. 9, pp.3905-3908, May 2014.
[3] Siddharth Pande Int. Journal of Engineering Research and Applications,” Modified approximate 8-point multiplier less DCT like transform, www.ijera.com ISSN: 2248-9622,Vol. 5, Issue 5, ( Part -1) pp.87-90 May 2014.
[4] Dhandapani and Ramachandran EURASIP Journal on Advances in Signal Processing,” Area and power efficient DCT architecture for image compression,” IEEE Transactions On Circuits And Systems, Vol. 61, No. 6, pp.354-358, June 2013.
[5] Subarna Dutta, Aditya Abhinav,Partha Dutta, Purushottam Kumar, and Amiya Halder,” An efficient image compression algorithm based on histogram based block optimization and arithmetic coding”, International Journal of Computer Theory and Engineering, Vol. 4, No. 6, December 2012.
[6] Amanjot Kaur, Jaspreet Kaur ,”Comparison of DCT and DWT of Image Compression techniques,” ISSN: 2278- 067X,Volume 1, Issue 4, pp.49-52 ,June 2012.
[7] Trinadh Balaga, B.Bhaskar Rao International Journal of Engineering and Advanced Technology (IJEAT),”1D Discrete Cosine Transform Using Distributed Algorithm,” ISSN: 2249 8958,Volume-1, Issue-3, pp-39-43, February 2012.
[8] Renato J. Cintra, Senior Member, IEEE, and Fbio M. Bayer,” A DCT Approximation for Image Compression,” IEEE Signal Processing Letters, vol. 18, no. 10, pp.579-582 october 2011.
[9] An Introduction to Image Compression Wei-Yi, Wei Graduate Institute of Communication Engineering National Taiwan University, Taipei, Taiwan,”Shape- Adaptive Image Compression,”.
[10] ECE 533 Project Report Paula Aguilera,”Comparison of different image compression formats