Image Compression by Redundancy Reduction

  • Carlos Magno Sousa
  • André Borges Cavalcante
  • Denner Guilhon
  • Allan Kardec Barros
Conference paper

DOI: 10.1007/978-3-540-74494-8_53

Volume 4666 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Sousa C.M., Cavalcante A.B., Guilhon D., Barros A.K. (2007) Image Compression by Redundancy Reduction. In: Davies M.E., James C.J., Abdallah S.A., Plumbley M.D. (eds) Independent Component Analysis and Signal Separation. ICA 2007. Lecture Notes in Computer Science, vol 4666. Springer, Berlin, Heidelberg

Abstract

Image compression is achieved by reducing redundancy between neighboring pixels but preserving features such as edges and contours of the original image. Deterministic and statistical models are usually employed to reduce redundancy. Compression methods that use statistics have heavily been influenced by neuroscience research. In this work, we propose an image compression system based on the efficient coding concept derived from neural information processing models. The system performance is compared with principal component analysis (PCA) and the discrete cosine transform (DCT) at several compression ratios (CR). Evaluation through both visual inspection and objective measurements showed that the proposed system is more robust to distortions such as ringing and block artifacts than PCA and DCT.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Carlos Magno Sousa
  • André Borges Cavalcante
  • Denner Guilhon
  • Allan Kardec Barros

There are no affiliations available