Image Compression Using Adaptive Variable Degree Variable Segment Length Chebyshev Polynomials

  • I. A. Al-Jarwan
  • M. J. Zemerly
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3540)


In this paper, a new lossy image compression technique based on adaptive variable degree variable segment length Chebyshev polynomials is proposed. The main advantage of this method over JPEG is that it has a direct individual error control where the maximum error in gray level difference between the original and the reconstructed images can be specified by the user. This is a requirement for medical applications where near lossless quality is needed. The compression is achieved by representing the gray level variations across any determined section of a row or column of an image by the coefficients of a Chebyshev polynomial. The performance of the method was evaluated on a number of test images and using some quantitative measures compared to the well known JPEG compression techniques.


Reconstructed Image Compression Ratio Chebyshev Polynomial Image Compression Compression Technique 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Wallace, G.: The JPEG Still Picture Compression Standard. CACM 34, 33–40 (1990)Google Scholar
  2. 2.
    Bethel, D.M., Monro, D.M.: Polynomial image coding with vector quantised compensation. In: Proc. ICASSP 1995, vol. 4, pp. 2499–2502 (1995)Google Scholar
  3. 3.
    Chee, Y., Park, K.: Medical image compression using the characteristics of human visual system. In: Proc. 16th Int. Conf. of the IEEE, Eng. Advances: New Opportunities for Biomedical Eng., vol. 1, pp. 618–619 (1994)Google Scholar
  4. 4.
    De Natale, F., et al.: Polynomial Approximation and Vector Quantization: A Region-Based Approach. IEEE Trans. On Communications 43(2-4), 198–206 (1995)zbMATHCrossRefGoogle Scholar
  5. 5.
    Helzer, A., et al.: Using implicit polynomials for image compression. In: Proc. 21st IEEE Conv. of the EEEI, pp. 384–388 (2000)Google Scholar
  6. 6.
    Sadeh, I.: Polynomial Approximation of Images. Computers Math. Applications 32(5), 99–115 (1995)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Al-Mutawwa, N., Zemerly, M.J.: Image Compression using Adaptive Chebyshev Polynomials. WSEAS Trans. On Mathematics 3(2), 417–422 (2004)Google Scholar
  8. 8.
    Al-Jarwan, I., Zemerly, M.J., et al.: Image Compression using Adaptive Fixed-Degree Chebyshev Polynomials. In: Proc. IEEE-GCC, Bahrain (November 2004)Google Scholar
  9. 9.
    Cox, M.G., Hayes, J.G.: Curve Fitting: A guide and suite of Algorithms for the Non-Specialist user. NPL Report NAC 26 (December 1973)Google Scholar
  10. 10.
    Clenshaw, C.W.: Mathematical Tables, vol. 5. National Physical Laboratory, London (1962)Google Scholar
  11. 11.
    Numerical Recipes in c: The Art of Scientific Computing. Cambridge University Press, Cambridge (1988–1992)Google Scholar
  12. 12.
    Zemerly, M.J.: A rule-based system for processing retinal images., Ph.D. thesis, University of Birmingham, U.K (August 1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • I. A. Al-Jarwan
    • 1
  • M. J. Zemerly
    • 1
  1. 1.Department of Computer EngineeringEtisalat College of EngineeringSharjahUnited Arab Emirates

Personalised recommendations