Lossless and Lossy Data Compression

  • Wee Keong Ng
  • Sunghyun Choi
  • Chinya Ravishankar


Data compression (or source coding) is the process of creating binary representations of data which require less storage space than the original data [7, 14, 15]. Lossless compression is used where perfect reproduction is required while lossy compression is used where perfect reproduction is not possible or requires too many bits. Achieving optimal compression with respect to resource constraints is a difficult problem. For instance, in lossless compression, it has been shown to be NP-complete [13]. In this paper, we present genetic algorithms for performing lossless and lossy compressions respectively on text data and Gaussian-Markov sources.


Word Length Parent Chromosome Lossless Compression Conventional Algorithm Codebook Size 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T. C. Bell, J. G. Cleary, I. H. Witten. Text Compression. Prentice Hall Inc., Englewood Cliffs, New Jersey, 1990.Google Scholar
  2. 2.
    K. A. Dejong, W. M. Spears. Using Genetic Algorithms to Solve NPComplete Problems. Proceedings of the 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, California, 1989.Google Scholar
  3. 3.
    A. Gersho. On the Structure of Vector Quantizers. IEEE Transactions on Information Theory, Vol. 28, No. 2, pp. 157–166, March 1982.Google Scholar
  4. 4.
    A. Gersho, R. M. Gray. Vector Quantization and Signal Compression. Kluwer Academic Publishers, Boston, Massachusetts, 1992.MATHCrossRefGoogle Scholar
  5. 5.
    D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989.MATHGoogle Scholar
  6. 6.
    R. M. Gray. Vector Quantization. IEEE ASSP Magazine, Vol. 1, pp. 4–29, April 1984.CrossRefGoogle Scholar
  7. 7.
    R. M. Gray. Source Coding Theory. Kluwer Academic Publishers, Boston, Massachusetts, 1990.MATHGoogle Scholar
  8. 8.
    J. H. Holland. Adaptation in Natural and Artificial Systerms: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge, Massachusetts, 1992.Google Scholar
  9. 9.
    D. A. Huffman. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the I. R. E., Vol. 40, No. 9, pp. 1098–1101. 1952.Google Scholar
  10. 10.
    S. P. Lloyd. Least Squares Quantization in PCM. IEEE Transactions on Information Theory, Vol. 28, No. 2, pp. 127–135. March 1982.MathSciNetCrossRefGoogle Scholar
  11. 11.
    W. K. Ng, C. V. Ravishankar. A Preliminary Study of Genetic Data Compression. Proceedings of the 6th International Conference on Genetic Algorithms, L. Eshelman (ed.), Morgan Kaufmann, San Francisco, California, 1995.Google Scholar
  12. 12.
    W. K. Ng, S. Choi, C. V. Ravishankar. An Evolutionary Approach to Vector Quantizer Design. Proceedings of the 2nd IEEE International Conference on Evolutionary Computing, Perth, Western Australia, November 29-December 1, 1995.Google Scholar
  13. 13.
    J. A. Storer, T. G. Szymanski. Data Compression via Textual Substitution. Journal of the ACM, Vol. 29, No. 4, pp. 928–951, 1982.MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    R. Veldhuis. An Introduction to Source Coding. Prentice-Hall, New York, New York, 1993.MATHGoogle Scholar
  15. 15.
    R. N. Williams. Adaptive Data Compression. Kluwer Academic Publishers, Boston, Massachusetts, 1991.MATHCrossRefGoogle Scholar
  16. 16.
    I. H. Witten, R. M. Neal, J. G. Cleary. Arithmetic Coding for Data Compression. Communications of the ACM, Vol. 30, No. 6, pp. 520–540, June 1987.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Wee Keong Ng
    • 1
  • Sunghyun Choi
    • 1
  • Chinya Ravishankar
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceThe University of MichiganAnn ArborUSA

Personalised recommendations