Abstract
The SPIHT image compression algorithm is characterized by low computational complexity, good performance, and the production of a quality scalable bitstream that can be decoded at several bit-rates with image quality enhancement as more bits are received. However, it suffers from the enormous computer memory consumption due to utilizing linked lists of size of about 2–3 times the image size. In addition, it does not exploit the multi-resolution feature of the wavelet transform to produce a resolution scalable bitstream by which the image can be decoded at numerous resolutions (sizes). The Single List SPIHT (SLS) algorithm resolved the high memory problem of SPIHT by using only one list of fixed size equals to just 1/4 the image size, and state marker bits with an average of 2.25 bits/pixel. This paper introduces two new algorithms that are based on SLS. Like SLS, the first algorithm also produces a quality scalable bitstream. However, it has lower time complexity and better performance than SLS. The second algorithm, which is the major contribution of the work, upgrades the first algorithm to produce a bitstream that is both quality and resolution scalable. As such, the algorithm is very suitable for the modern heterogeneous nature of the internet users to satisfy their different capabilities and desires in terms of image quality and resolution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and materials
The datasets used are available freely on the Internet, and can be accessed using the following link https://ccia.ugr.es/cvg/CG/base.htm
References
Uthayakumar, J., et al.: A survey on data compression techniques: from the perspective of data quality, coding schemes, data type and applications. J. King Saud Univ. Comput. Inf. Sci. 33(2), 119–140 (2021). https://doi.org/10.1016/j.jksuci.2018.05.006
Rohit, M., et al.: Hybrid and advanced compression techniques for medical images, 1st edn. Springer, Heidelberg (2019)
Taubman, D., et al.: Embedded block coding in JPEG 2000. Signal Process. Image Commun. 17(1), 49–72 (2002). https://doi.org/10.1016/S0923-5965(01)00028-5
Rüefenacht, D., et al.: Base-anchored model for highly scalable and accessible compression of multiview imagery. IEEE Trans. Image Process. 28(7), 3205–3218 (2019). https://doi.org/10.1109/TIP.2019.2894968
Patrick, J.V.F.: Discrete wavelet transformations: an elementary approach with application. Wiley (2019)
Al-Janabi, A.K., et al.: An efficient and highly scalable listless SPIHT image compression framework. J. Appl. Res. Technol. 20(2), 173–187 (2022). https://doi.org/10.22201/icat.24486736e.2022.20.2.1269
Said, A., et al.: A new, fast, and efficient image codec based on set partitioning in hierarchical trees. IEEE Trans. Circuits Syst. Video Technol. 6(3), 243–250 (1996). https://doi.org/10.1109/76.49984
Lee, R.C., et al.: New modified SPIHT algorithm for data compression system. J. Med. Biol. Eng. 39, 18–26 (2019). https://doi.org/10.1007/s40846-018-0384-z
Senapati, R.K., et al.: Listless block-tree set partitioning algorithm for very low bit rate embedded image compression. AEU Int. J. Electron. Commun. 66(12), 985–995 (2012). https://doi.org/10.1016/j.aeue.2012.05.001
Drozdek, A.: Data structure and algorithms in C++, 4th edn. Cengage Learning Press (2012)
Alam, M., et al.: Modified listless set partitioning in hierarchical trees (MLS) for memory constrained image coding applications. Curr. Trends Signal Process. 2(2), 56–66 (2012). https://doi.org/10.37591/ctsp.v2i1-3.5124
Deepthi, S.A. et al.: Image transmission and compression techniques using SPIHT and EZW in WSN. 2018 2nd International Conference on Inventive Systems and Control (ICISC), Coimbatore, pp. 1146–1149 (2018). https://doi.org/10.1109/ICISC.2018.8398984
Al-Janabi, A.K.: Low memory set-partitioning in hierarchical trees image compression algorithm. Int. J. Video Image Process. Netw. Secur. 13(2), 12–18 (2013)
Monauwer, A., et al.: Listless highly scalable set partitioning in hierarchical trees coding for transmission of image over heterogeneous networks. Int. J. Comput. Netw. Wirel. Mob. Commun. 2(3), 36–48 (2012)
http://www.spiht.com/spiht3.html#mat-spiht (2022). Accessed 22 Aug 2022
Al-Janabi, A.K.: Efficient and simple scalable image compression algorithms. Ain Shams Eng. J. 10(3), 463–470 (2019). https://doi.org/10.1016/j.asej.2019.01.008
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
YJH prepared all the tables in the paper. MFH prepared all the Figs in the paper. All authors revised the paper.
Corresponding author
Ethics declarations
Conflict of interest
Not applicable.
Ethical approval
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Below is the link to the electronic supplementary material.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Al-Janabi, A.K., Harbi, Y.J. & Hassan, M.F. Scalable image compression algorithms with small and fixed-size memory. SIViP 17, 3331–3338 (2023). https://doi.org/10.1007/s11760-023-02554-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11760-023-02554-7