CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Efficient Scalable Image Compression Algorithms with Low Memory and Complexity

by Ali Kadhim Jaber Al-Janabi, Abdulkareem Abdulrahman Kadhim
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 136 - Number 9
Year of Publication: 2016
Authors: Ali Kadhim Jaber Al-Janabi, Abdulkareem Abdulrahman Kadhim
10.5120/ijca2016908564

Ali Kadhim Jaber Al-Janabi, Abdulkareem Abdulrahman Kadhim . Efficient Scalable Image Compression Algorithms with Low Memory and Complexity. International Journal of Computer Applications. 136, 9 ( February 2016), 12-19. DOI=10.5120/ijca2016908564

@article{ 10.5120/ijca2016908564,
author = { Ali Kadhim Jaber Al-Janabi, Abdulkareem Abdulrahman Kadhim },
title = { Efficient Scalable Image Compression Algorithms with Low Memory and Complexity },
journal = { International Journal of Computer Applications },
issue_date = { February 2016 },
volume = { 136 },
number = { 9 },
month = { February },
year = { 2016 },
issn = { 0975-8887 },
pages = { 12-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume136/number9/24181-2016908564/ },
doi = { 10.5120/ijca2016908564 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:36:38.172491+05:30
%A Ali Kadhim Jaber Al-Janabi
%A Abdulkareem Abdulrahman Kadhim
%T Efficient Scalable Image Compression Algorithms with Low Memory and Complexity
%J International Journal of Computer Applications
%@ 0975-8887
%V 136
%N 9
%P 12-19
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The set partitioning embedded block (SPECK) image compression algorithm has excellent performance, low computational complexity, and produces a rate scalable compressed bitstream that can be decoded efficiently at multiple bit-rates. Unfortunately, it consumes a huge amount of computer memory due to employing lists that store the coordinates of the image pixels and the coordinates of the sets that are generated during the coding process. In addition, it has complex memory management due to using an array of random access linked lists to store these sets according to their sizes. In this paper, we propose two algorithms that are based on SPECK. The main contribution of the first algorithm is that, as compared to SPECK, the amount of the algorithm’s usable memory is reduced to about 75% and at the same time its processing speed is increased and its rate distortion efficiency is preserved as will be demonstrated. The second algorithm has higher processing speed but has slightly lower rate distortion performance than the first algorithm.

References
  1. Goyal V.K, “Theoretical Foundations of Transform Coding”, IEEE Signal Processing Magazine, Vol. 18, No.9, pp. 9-21, Sep.2001.
  2. Rabbani, M. and Joshi, R., “An Overview of the JPEG 2000 Still Image Compression Standard”, Signal Processing: Image Communication, Vol. 17, No. 1, pp. 3-48, Jan. 2002.
  3. Taubman D., Weinberger M., Seroussi G., Ueno I., and Ono F., “Embedded Block Coding in JPEG2000,” Signal Processing: Image Communication Vol. 17, No. 1, pp. 49-72, Jan. 2002.
  4. Ordentlich E., Weinberger M. and Seroussi G., “A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients”, Proc. IEEE Data Compression Conference, DCC 98, Snowbird, pp. 408-417, March 1998.
  5. Li J. and Lei S., “An Embedded Still Image Coder with Rate-Distortion Optimization”, IEEE Trans. on Image Processing, Vol. 8, No. 7, pp. 913-924, July 1999.
  6. Said, A. and Pearlman, W.A., “A New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees”, IEEE Trans. on Circuits & Systems for Video Technology, Vol. 6, No. 3, pp. 243-250, 1996.
  7. Pearlman, W.A, Islam, A., Nagaraj, N. and Said, A., “Efficient, Low Complexity Image Coding with a Set-Partitioning Embedded Block Coder”, IEEE Trans. on Circuits &Systems for Video Technology, Vol. 14, No. 11, pp. 1219-1235, Nov. 2004.
  8. Lamsrichan P., “A fast algorithm for low-memory embedded wavelet-based image coding without list”, the 8th Int. Conf. on Electrical Engineering/Electronics, Computer, Telecom. & Information Technology (ECTI-CON), pp. 979-982, Khon Kaen, May 2011.
  9. Jianjum, W. and Bo Liu, “Modified SPIHT Based Image Compression for Hardware Implementation”, IEEE Computer Society, Second Int. Workshop on Computer Science and Engineering, Qingdao, Vol. 2, pp. 572-576, Oct. 2009.
  10. Chrysafis C., Said A., Drukarev A., Islam A., & Pearlman, W.A, “SBHP-A Low Complexity Wavelet Coder,” IEEE Int. Conf. Acoustic., Speech and Sig. Proc. (ICASSP2000), Istanbul, Vol. 4, pp. 2035-2038, June 2000.
  11. Berman, A.M., “Data Structures via C++: Objects by Evolution”, 1st edition, Oxford University Press, New York, USA, 1997.
  12. Latte M., Ayachit N. and Deshpande D., “Reduced memory listless SPECK image compression”, Elsevier Science, Digital Signal Process. Vol. 16, No. 6, pp. 817–824, Nov. 2006.
  13. Senapati R. and Mankar P., “Improved Listless Embedded Block Partitioning Algorithms for Image Compression”, International Journal of Image and Graphics, Vol. 14, No. 4, pp. 1–32, Dec. 2014.
  14. Hsiang S. and Woods J., “Embedded Image Coding Using Zeroblocks of Subband/Wavelet Coefficients and Context Modeling”, the 2000 IEEE Int. Symp. on Circuits and Systems (ISCAS2000), Geneva, Vol. 3, pp. 662–665, May 2000.
  15. Zhang Y.Z, Chao X., Wen T. W., and Liang B. C., “Performance Analysis and Architecture Design for Parallel EBCOT Encoder of JPEG2000,” IEEE Trans. on Circuits & Systems for Video Technology, Vol. 17, No. 10, pp. 1336-1347, Oct. 2007.
  16. Pearlman, W.A., “Trends of Tree-Based, Set-Partitioning Compression Techniques in Still and Moving Image Systems”, Proceedings Picture Coding Symposium (PCS-2001), Seoul, Korea, 25-27, pp. 1-8, April, 2001.
  17. Al-Janabi A.K, “Low Memory Set-Partitioning in Hierarchical Trees Image Compression Algorithm,” International Journal of Video & Image Processing and Network Security IJVIPNS-IJENS, Vol. 13, No. 2, pp. 12-18, April 2013.
  18. Al-Janabi A.K, “Ultrafast and Efficient Scalable Image Compression Algorithm”, Journal of ICT Res. Appl., to be published.
  19. Sakalli M., Pearlman W.A, and Farshchian M., “SPIHT algorithms using Depth First Search Algorithm with minimum memory usage”, IEEE 40th Annual Conference on Information Sciences and Systems, pp. 1158-1163, Princeton, NJ, 22-24 March 2006.
  20. Wern L., Minn A. and Seng K, “Reduced Memory SPIHT Coding using Wavelet Transform with Post-Processing”, IEEE Inter. Conf. on Intelligent Human-Machine Systems and Cybernetics, IHMSC '09, pp. 371-374, Hangzhou, Zhejiang, Aug. 2009.
  21. Arora H., Singh P., Khan E., and Ghani F., “Memory Efficient Set Partitioning in Hierarchical Tree (MESH) for Wavelet Image Compression”, ICASSP 2005, pp. 385-388, Mar. 2005.
  22. Salomon, D., “Data Compression: the Complete Reference”, 3rd ed., Springer, New York, USA, 2004.
  23. Al-Janabi, A.K., “Highly Scalable Single List Set Partitioning in Hierarchical Trees Image Compression”, IOSR Journal of Electronics and Communication Engineering, Vol. 9, No. 1, pp. 36-47, 2014. DOI: 10.9790/2834-09133647.
Index Terms

Computer Science
Information Sciences

Keywords

DWT Embedded Coding Low Memory Scalable Image Compression Set Partitioning algorithms SPECK SPIHT Wavelet-based Image Compression.

Powered by PhDFocusTM