Y.M. Krainyk, D.V. Dotsenko
Èlektron. model. 2024, 46(2):75-87
https://doi.org/10.15407/emodel.46.02.075
ABSTRACT
An image compression method based on a combined approach using image preprocessing and the Huffman algorithm is presented. The organization of the processing cycle according to this method is proposed and the experimental results of the method on a test set of images are given. The combined approach allows achieving better compression ratio in comparison with individual application of one of the methods. During the processing stage of the proposed method, the color conversion procedure is to be applied. Then, the converted image data forms two blocks of information that will be processed further, main area and node pixels area. Individual compression methods are applied to each of them at the next stage. Application of Huffman algorithm to the node points directly or in the differential representation induced that the second option generates similar distribution form regardless of image content and, hence, is more suitable for better compression results. The results of both procedures are further combined and are transferred either to other devices or may be stored on the corresponding storage device. The proposed compression method may be incorporated during implementation of new image compression formats, in embedded systems that have limited computational resources but still need work with graphics elements.
KEYWORDS
image, compression, Huffman algorithm, node values, efficiency, quality, comparison, QOI algorithm.
REFERENCES
- Krainyk, Y. (2022). Combined run-length and huffman encoding for image compression. Petro Mohyla Black Sea National University.
https://doi.org/10.21203/rs.3.rs-1982410/v1 - Yang, Y., Yuhua, P., & Zhaoguang, L. (2007). A fast algorithm for ycbcr to RGB conversion. IEEE Transactions on Consumer Electronics, 53(4), 1490-
https://doi.org/10.1109/TCE.2007.4429242 - Stabno, M., & Wrembel, R. (2009). RLH: Bitmap compression technique based on run-length and Huffman encoding. Information Systems, 34(4-5), 400-
https://doi.org/10.1016/j.is.2008.11.002 - Miano, J. (1999). Compressed image file formats: JPEG, PNG, GIF, XBM, BMP. Addison Wesley Longman.
- Krainyk, Y., & Dzyaman, E. (2023). Application of the QOI algorithm in image compression. In Information Technology and Engineering (pp. 70-71).
- Dominic, S. QOI — The Quite OK Image Format. https://qoiformat.org/qoispecification.pdf
- Apostolico, A. (2007b). Fast gapped variants for Lempel–Ziv–Welch compression. Information and Computation, 205(7), 1012-
https://doi.org/10.1016/j.ic.2007.03.001 - Ziv, J. (2009). The universal LZ77 compression algorithm is essentially optimal for individual finite-length n-blocks. IEEE Transactions on Information Theory, 55(5), 1941-
https://doi.org/10.1109/TIT.2009.2016069 - Wu, Y., Li, X., Zhang, Z., Jin, X., & Chen, Z. (2021). Learned block-based hybrid image compression. IEEE Transactions on Circuits and Systems for Video Technology, 1.
https://doi.org/10.1109/TCSVT.2021.3119660 - Jagadish, H., Pujar, M., Lohit, M., & Kadlaskar, A. (б. д.). New lossless method of image compression and decompression using huffman coding techniques. Journal of Theoretical and Applied Information Technology, (2010).