Images compression by using cubic spline-functions methods

Authors

DOI:

https://doi.org/10.15587/2312-8372.2018.134978

Keywords:

images coding, compression images, raster images, coefficients of the spline function, approximating polynomial

Abstract

The object of research is image compression algorithms based on mathematical methods. The main problem with image compression is loss of quality during recovery. The approach is proposed in which the user can determine the quality of the reconstructed image itself. This is achieved due to the use of the spline interpolation method, which allows to set the compression ratio, thus controlling the quality of the decoded image.

The use of the spline function for image compression makes it possible to reduce the processing time of files due to the simplicity of the mathematical model of the algorithm. Given the accuracy of the restored image, the algorithm determines the size of the compressed file, depending on the color scale.

As a result of the analysis of the proposed development, the compression coefficients are shown, which show that the size of the compressed image can be smaller than the original image by 5070 %. The decoding is performed using known spline function coefficients. The result is compared with the original file. The difference between the intensity of the points of the source and decoded images determines the quality of the restoration.

An algorithm is obtained that allows one to specify the accuracy of the reconstructed image. This result depends on the weighting coefficients of the spline function, which affect the accuracy of the construction of the approximating polynomial. A feature of the proposed approach is the ability of the user to specify the accuracy and quality of the image after decoding. This is achieved due to the fact that points close in intensity value are restored with a small error.

In this paper, let’s propose an approach involving the sequential extraction of blocks of points of equal intensity. For the selected blocks, an approximating polynomial is constructed based on the spline function, and the coefficients of the polynomial are transferred to a file containing information for image reconstruction. So it is possible to obtain large compression ratios by building a polynomial for blocks containing points that are close in intensity.

Author Biographies

Kateryna Kotsiubivska, Kyiv University of Culture and Arts, 36, Evgeniya Konovaltsa str., Kyiv, Ukraine, 01601

PhD, Associate Professor

Department of Computer Sciences

Olena Chaikovska, Kyiv University of Culture and Arts, 36, Evgeniya Konovaltsa str., Kyiv, Ukraine, 01601

PhD, Associate Professor, Head of the Department

Department of Computer Sciences

Maryna Tolmach, Kyiv University of Culture and Arts, 36, Evgeniya Konovaltsa str., Kyiv, Ukraine, 01601

Lecturer

Department of Computer Sciences

Svitlana Khrushch, Kyiv University of Culture and Arts, 36, Evgeniya Konovaltsa str., Kyiv, Ukraine, 01601

Department of Computer Sciences

References

  1. Lezhnev, V. G. (2009). Matematicheskie algoritmy szhatiya izobrazheniy. Krasnodar: Kuban. gos. un-t, 55.
  2. Obzor algoritmov szhatiya s poteryami. Available at: http://mf.grsu.by/UchProc/livak/po/comprsite/theory_fractal.html. Last accessed: 02.12.2017.
  3. Metody szhatiya dannykh: Szhatie izobrazheniy. Available at: http://www.compression.ru/book/part2/part2__3.htm. Last accessed: 04.12.2017.
  4. Jiao, L. C., Tan, S., Liu, F. (2005). Ridgelet theory: from ridgelet transform to curvelet. Chinese Journal of Engineering Mathematics, 22 (5), 761–773.
  5. Chiang, T.-H., Dung, L.-R. (2007). A VLSI Progressive Coding for Wavelet-based Image Compression. IEEE Transactions on Consumer Electronics, 53 (2), 569–577. doi: http://doi.org/10.1109/tce.2007.381731
  6. Velisavljevic, V., Beferull-Lozano, B., Vetterli, M. (2007). Space-Frequency Quantization for Image Compression With Directionlets. IEEE Transactions on Image Processing, 16 (7), 1761–1773. doi: http://doi.org/10.1109/tip.2007.899183
  7. Iano, Y., da Silva, F. S., Cruz, A. L. M. (2006). A fast and efficient hybrid fractal-wavelet image coder. IEEE Transactions on Image Processing, 15 (1), 98–105. doi: http://doi.org/10.1109/tip.2005.860317
  8. Utsugi, A. (2002). Independent components of natural images under variable compression rate. Neurocomputing, 49 (1–4), 175–185. doi: http://doi.org/10.1016/s0925-2312(02)00530-1
  9. Remya, S., Dilshad Rasheed, V. A. (2013). Resolution Progressive Compression of Encrypted Images. International Journal of Signal Processing Systems, 1 (1), 7–10. doi: http://doi.org/10.12720/ijsps.1.1.7-10
  10. Elharar, E., Stern, A., Hadar, O., Javidi, B. (2007). A Hybrid Compression Method for Integral Images Using Discrete Wavelet Transform and Discrete Cosine Transform. Journal of Display Technology, 3 (3), 321–325. doi: http://doi.org/10.1109/jdt.2007.900915

Published

2018-01-23

How to Cite

Kotsiubivska, K., Chaikovska, O., Tolmach, M., & Khrushch, S. (2018). Images compression by using cubic spline-functions methods. Technology Audit and Production Reserves, 3(2(41), 4–10. https://doi.org/10.15587/2312-8372.2018.134978

Issue

Section

Information Technologies: Original Research