Data compression algorithms for visual information

Jonathan Gana Kolo*, Kah Phooi Seng, Li Minn Ang, S. R.S. Prabaharan

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

1 Citation (Scopus)

Abstract

Audio-visual information is one of the richest but also most bandwidth-consuming modes of communication. To meet the requirements of new applications, powerful data compression schemes are needed to reduce the global bit rate drastically. In this paper, we proposed a simple lossless visual image compression scheme that will be used to compress visual images. In this scheme, the two dimensional visual image data is converted to a one dimensional data using our proposed pixel scanning method. The difference between consecutive pixel values in the resulting one dimensional image data is taken and the residues are encoded losslessly using an entropy encoder. The working principles of this our approach is presented together with the image compression algorithm used. We developed a software algorithm and implemented it to compress some standard test images using Huffman style coding techniques in a MATLAB platform.

Original languageEnglish
Title of host publicationInformatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings
Pages484-497
Number of pages14
EditionPART 3
DOIs
Publication statusPublished - 2011
Externally publishedYes
EventInternational Conference on Informatics Engineering and Information Science, ICIEIS 2011 - Kuala Lumpur, Malaysia
Duration: 14 Nov 201116 Nov 2011

Publication series

NameCommunications in Computer and Information Science
NumberPART 3
Volume253 CCIS
ISSN (Print)1865-0929

Conference

ConferenceInternational Conference on Informatics Engineering and Information Science, ICIEIS 2011
Country/TerritoryMalaysia
CityKuala Lumpur
Period14/11/1116/11/11

Keywords

  • Audio-Visual information
  • Huffman coding
  • Lossless Image Compression
  • Wireless Sensor Network

Cite this