Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 1.102
JCR 5-Year IF: 0.734
Issues per year: 4
Current issue: Feb 2021
Next issue: May 2021
Avg review time: 54 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


1,625,344 unique visits
Since November 1, 2009

Robots online now


SCImago Journal & Country Rank


Anycast DNS Hosting

 Volume 21 (2021)
     »   Issue 1 / 2021
 Volume 20 (2020)
     »   Issue 4 / 2020
     »   Issue 3 / 2020
     »   Issue 2 / 2020
     »   Issue 1 / 2020
 Volume 19 (2019)
     »   Issue 4 / 2019
     »   Issue 3 / 2019
     »   Issue 2 / 2019
     »   Issue 1 / 2019
 Volume 18 (2018)
     »   Issue 4 / 2018
     »   Issue 3 / 2018
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
  View all issues  


Release of the v3 version of AECE Journal website. We moved to a new server and implemented the latest cryptographic protocols to assure better compatibility with the most recent browsers. Our website accepts now only TLS 1.2 and TLS 1.3 secure connections.

Clarivate Analytics published the InCites Journal Citations Report for 2019. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.102 (1.023 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.734.

Starting on the 15th of June 2020 we wiil introduce a new policy for reviewers. Reviewers who provide timely and substantial comments will receive a discount voucher entitling them to an APC reduction. Vouchers (worth of 25 EUR or 50 EUR, depending on the review quality) will be assigned to reviewers after the final decision of the reviewed paper is given. Vouchers issued to specific individuals are not transferable.

Starting on the 15th of December 2019 all paper authors are required to enter their SCOPUS IDs. You may use the free SCOPUS ID lookup form to find yours in case you don't remember it.

Clarivate Analytics published the InCites Journal Citations Report for 2018. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.650, and the JCR 5-Year Impact Factor is 0.639.

Read More »


  1/2021 - 10

Lossy Compression using Adaptive Polynomial Image Encoding

OTHMAN, S. See more information about OTHMAN, S. on SCOPUS See more information about OTHMAN, S. on IEEExplore See more information about OTHMAN, S. on Web of Science, MOHAMED, A. See more information about  MOHAMED, A. on SCOPUS See more information about  MOHAMED, A. on SCOPUS See more information about MOHAMED, A. on Web of Science, ABOUALI, A. See more information about  ABOUALI, A. on SCOPUS See more information about  ABOUALI, A. on SCOPUS See more information about ABOUALI, A. on Web of Science, NOSSAIR, Z. See more information about NOSSAIR, Z. on SCOPUS See more information about NOSSAIR, Z. on SCOPUS See more information about NOSSAIR, Z. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,465 KB) | Citation | Downloads: 63 | Views: 67

Author keywords
adaptive, compression, decoding, encoding, polynomial

References keywords
image(36), comput(11), techniques(9), encoding(8), technol(7), coding(7), fitting(6), algorithm(6), technology(5), survey(5)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2021-02-28
Volume 21, Issue 1, Year 2021, On page(s): 91 - 98
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2021.01010
Web of Science Accession Number: 000624018800010
SCOPUS ID: 85102848184

Quick view
Full text preview
In this paper, an efficient lossy compression approach using adaptive-block polynomial curve-fitting encoding is proposed. The main idea of polynomial curve fitting is to reduce the number of data elements in an image block to a few coefficients. The proposed approach consists of two processes: encoding and decoding. In the encoding process, the coefficient matrix is created by representing each block of the image with a first- or second-order two-dimensional polynomial. The encoded block size of the image is variable. The polynomial order and the encoded block size are determined dynamically depending on the value of a threshold. A prefix code of two bits is used to differentiate the encoding states. Uniform quantization is applied to the coefficient matrix to store these coefficients effectively. In the decoding process, the reconstructed (decompressed) image is built from the quantized coefficient matrix. The fitting variables are two-dimensional (x, y). The encoding and decoding processes require a single image scan without the need to transfer the matrix to another domain. Experimentally, a high compression ratio is achieved at an acceptable quality for both gray and color images. The results are comparable to those of most recent studies.

References | Cited By  «-- Click to see who has cited this paper

[1] H. Ackar, A. A. Almisreb, and M. A. Saleh, "A review on image enhancement techniques," Southeast Europe J. Soft Comput., vol. 8, no. 1, pp. 42-48, Apr. 2019.

[2] M. Maru and M. C. Parikh, "Image restoration techniques: A survey," Int. J. Comput. Appl., vol. 160, no. 6, pp. 15-19, Feb. 2017.

[3] N. Dhanachandra and Y. J. Chanu, "A survey on image segmentation methods using clustering techniques," Eur. J. Eng. Res. Sci., vol. 2, no. 1, pp. 15-20, Jan. 2017.

[4] P. V. Kumaraguru and V. J. Chakravarthy, "An image feature extraction and image representation strategies for the analysis of image processing," Indian J. Forensic Medicine Toxicology, vol. 11, no. 2, pp. 642-648, Nov. 2017.

[5] K. Chopra and I. S. Virk, "Image steganography using edge detection technique," Int. J. Comput. Sci. Eng., vol. 6, no. 12, pp. 222-227, Dec. 2018.

[6] D. Maia and R. Trindade, "Face detection and recognition in color images under matlab," Int. J. Signal Process. Image Process. Pattern Recognit., vol. 9, no. 2, pp. 13-24, Feb. 2016.

[7] M. A. Saleh, "Image steganography techniques - a review paper," IJARCCE, vol. 7, no. 9, pp. 52-58, Sep. 2018.

[8] S. Khan and S. Khan, "An efficient content based image retrieval: CBIR," Int. J. Comput. Appl., vol. 152, no. 6, pp. 33-37, Oct. 2016.

[9] M. Singh, S. Kumar, S. Singh, and M. Shrivastava, "Various image compression techniques: Lossy and lossless," Int. J. Comput. Appl., vol. 142, no. 6, pp. 23-26, May 2016.

[10] N. S. Singh and H. J. Singh, "Data compression techniques in wireless sensor network a survey," Int. J. Comput. Sci. Eng., vol. 7, no. 1, pp. 697-706, Jan. 2019.

[11] A. J. Hussain, A. Al-Fayadh, and N. Radi, "Image compression techniques: A survey in lossless and lossy algorithms," Neurocomputing, vol. 300, pp. 44-69, Jul. 2018.
[CrossRef] [Web of Science Times Cited 36] [SCOPUS Times Cited 54]

[12] S. Bhambay, S. Poojary, and P. Parag, "Fixed length differential encoding for real-time status updates," IEEE Trans. Commun., vol. 67, no. 3, pp. 2381-2392, Mar. 2019.
[CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 7]

[13] T. G. Swart and J. H. Weber, "Binary variable-to-fixed length balancing scheme with simple encoding/decoding," IEEE Commun. Lett., vol. 22, no. 10, pp. 1992-1995, Oct. 2018.
[CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 4]

[14] K. Negrat, R. Smko, and A. Almarimi, "Variable length encoding in multiple frequency domain steganography," in 2010 2nd Int. Conf. Softw. Technol. Eng., San Juan, PR, 2010, pp. V1-305-V301-309.
[CrossRef] [SCOPUS Times Cited 2]

[15] M. Jayedul and M. Nurul, "Study on data compression technique," Int. J. Comput. Appl., vol. 159, no. 5, pp. 6-13, Feb. 2017.

[16] S. M. Hardi, B. Angga, M. S. Lydia, I. Jaya, and J. T. Tarigan, "Comparative analysis run-length encoding algorithm and fibonacci code algorithm on image compression," J. Phys., vol. 1235, p. 012107, Jun. 2019.
[CrossRef] [SCOPUS Times Cited 2]

[17] M. Sangeetha, P. Betty, and G. S. N. Kumar, "A biometrie iris image compression using LZW and hybrid LZW coding algorithm," in 2017 Int. Conf. Innov. Inf. Embedded Commun. Syst. (ICIIECS), Coimbatore, India, 2017, pp. 1-6.
[CrossRef] [SCOPUS Times Cited 6]

[18] S. V. Viraktamath, M. V. Koti, and M. M. Bamagod, "Performance analysis of source coding techniques," in 2017 Int. Conf. Comput. Methodologies Commun. (ICCMC), Erode, India, 2017, pp. 689-692.
[CrossRef] [SCOPUS Times Cited 2]

[19] S. Yuan and J. Hu, "Research on image compression technology based on Huffman coding," J. Vis. Commun. Image Representation, vol. 59, pp. 33-38, Feb. 2019.
[CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 13]

[20] M. Sharma, "Arithmetic coding based string approximation," in 2017 6th Int. Conf. Rel. Infocom Technol. Optim. (Trends and Future Directions) (ICRITO), Noida, India, 2017, pp. 416-422.
[CrossRef] [SCOPUS Times Cited 1]

[21] N. H. Salman, "New image compression/decompression technique using arithmetic coding algorithm," J. Zankoy Sulaimani Part A, vol. 19, no. 1, pp. 263-272, Oct. 2016.

[22] M. George, M. Thomas, and C. K. Jayadas, "A methodology for spatial domain image compression based on hops encoding," Procedia Technol., vol. 25, pp. 52-59, Dec. 2016.
[CrossRef] [Web of Science Times Cited 4]

[23] M. Alzain, "Image encryption using chaotic cat mapping in the discrete fourier transform," Int. J. Comput. Technol., vol. 18, pp. 7389-7397, Nov. 2018.

[24] H. Ga and W. Zeng, "Image compression and encryption based on wavelet transform and chaos," Comput. Opt., vol. 43, no. 2, pp. 258-263, Apr. 2019.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 3]

[25] R. Shoitan, Z. Nossair, I. Isamil, and A. Tobal, "Hybrid wavelet measurement matrices for improving compressive imaging," Signal Image Video Process., vol. 11, no. 1, pp. 65-72, Apr. 2016.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 7]

[26] D. S. S. Satyanarayana, G. R. Reddy, R. S. P. Shanmukhanath, and K. Gaurav, "JPEG image compression using discrete cosine transform," Int. J. New Technol. Res., vol. 5, no. 10, pp. 52-55, Nov. 2019.

[27] S. Goswami and S. Mishra, "Lossless compression based image compression technique for medical imaging," Int. J. Recent Trends Eng. Res., vol. 4, no. 3, pp. 793-800, Sep. 2018.

[28] A. S. Yadav, H. Sadia, and S. Singh, "Lossy compression of color image using EZW and BTC," Int. J. Sci. Res., vol. 6, no. 12, pp. 1124-1127, Dec. 2017.

[29] T. Richter, "JPEG on STEROIDS: Common optimization techniques for JPEG image compression," in 2016 IEEE International Conference on Image Processing (ICIP), Phoenix, AZ, 2016, pp. 61-65.
[CrossRef] [SCOPUS Times Cited 8]

[30] F. Artuger and F. Ozkaynak, "Fractal image compression method for lossy data compression," in 2018 International Conference on Artificial Intelligence and Data Processing (IDAP), Malatya, Turkey, 2018, pp. 1-6.
[CrossRef] [SCOPUS Times Cited 3]

[31] A. H. Abouali, "Object-based VQ for image compression," Ain Shams Engineering Journal, vol. 6, no. 1, pp. 211-216, Mar. 2015.
[CrossRef] [Web of Science Times Cited 7] [SCOPUS Times Cited 9]

[32] G. Y. Jiang, Y. P. Zhu, M. Yu, and Y. Zhang, "Perceptual video coding: A survey," J. Electron. Inf. Technol., vol. 35, no. 2, pp. 474-483, Feb. 2014.
[CrossRef] [SCOPUS Times Cited 7]

[33] Z. B. Wu and J. Q. Yu, "Vector quantization: A review," Frontiers of Information Technology and Electronic Engineering, vol. 20, no. 4, pp. 507-524, Apr. 2019.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 4]

[34] A. Ghareeb and S. Z. Rida, "Image quality measures based on intuitionistic fuzzy similarity and inclusion measures," Journal of Intelligent & Fuzzy Systems, vol. 34, no. 6, pp. 4057-4065, Jun. 2018.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 4]

[35] R. J. Al-Bahadili, "Adaptive polynomial fitting for image compression based on variance of block pixels," Engineering and Technology Journal, vol. 33, pp. 1830-1844, Mar. 2015.

[36] Y. Q. Cai, H. X. Zou, and F. Yuan, "Adaptive compression method for underwater images based on perceived quality estimation," Frontiers Inf. Technol. Electron. Eng., vol. 20, no. 5, pp. 716-730, May 2019.
[CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 2]

[37] S. Ameer and O. Basir, "Image compression using plane fitting with inter-block prediction," Image Vision Comput., vol. 27, no. 4, pp. 385-390, Mar. 2009.
[CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 11]

[38] S. Sadanandan and V. K. Govindan, "Image compression with modified skipline encoding and curve fitting," International Journal of Computer Applications, vol. 74, no. 5, pp. 24-30, Jul. 2013.

[39] S. Sajikumar and A. K. Anilkumar, "Image compression using chebyshev polynomial surface fit," International Journal Of Pure and Applied Mathematical Science, vol.10, pp. 15-27, Oct. 2017

[40] E. Erdal and A. Ergüzen, "An efficient encoding algorithm using local path on huffman encoding algorithm for compression," Applied Science, vol. 9, no. 4, p. 782, Feb. 2019.
[CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 1]

[41] W. Khalaf, D. Zaghar, and N. Hashim, "Enhancement of curve-fitting image compression using hyperbolic function," Symmetry, vol. 11, no. 2, pp. 291, Feb. 2019.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 5]

[42] Y. Zhang, H. Wang, and J. Zhao, "Depth map compression based on platelet coding and quadratic curve fitting," in 2014 IEEE 27th Canadian Conference of Electrical and Computer Engineering (CCECE), Toronto, ON, 2014, pp. 1-4.
[CrossRef] [SCOPUS Times Cited 9]

[43] N. A. Ibraheem, M. M. Hasan, R. Z. Khan, P. K. Mishra," Understanding Color Models: A Review," ARPN Journal of Science and Technology, vol. 2, no.3, pp.265-275, Apr. 2012.

[44] S. M. Othman, A. E. Mohamed, Z. Nossair, and M. I. El-Adawy, "Image compression using polynomial fitting," in 2019 3rd International Conference on Electronics, Communication and Aerospace Technology (ICECA), Coimbatore, India, 2019, pp. 344-349.
[CrossRef] [SCOPUS Times Cited 2]

References Weight

Web of Science® Citations for all references: 99 TCR
SCOPUS® Citations for all references: 166 TCR

Web of Science® Average Citations per reference: 2 ACR
SCOPUS® Average Citations per reference: 4 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2021-05-17 16:01 in 278 seconds.

Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2021
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: