A new efficient method to compress images using polynomial curve fitting approximation techniques is presented in this paper. The polynomial curve fitting represents many pixels by a smaller number of polynomial coefficients. The presented method is based on two distinct scanning techniques of the image under compression. In the first technique, we scan the image row by row, and in this case, we use first or second order polynomial to represent the chosen number of pixels from the row. In the second case, we scan the image using a block of pixels with variable dimensions and represent each block by a first order two-dimensional polynomial. Experimentally the method gives an acceptable compression ratio with reasonable reconstructed image quality.
Image Compression Using Polynomial Fitting
2019-06-01
1667506 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Array Algebra Polynomial Fitting for Image Segmentation
British Library Online Contents | 1996
|Robust Image Compression using Multilevel Polynomial Interpolation
British Library Conference Proceedings | 1997
|Image compression using plane fitting with inter-block prediction
British Library Online Contents | 2009
|Fitting Polynomial Equations to Curves and Surfaces
NTRS | 1986
|