Data Compression Algorithms for Visual Information

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

Research output: Book chapter/Published conference paperConference paperpeer-review

1 Citation (Scopus)


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 publicationProceedings of the International Conference on Informatics Engineering and Information Science
Subtitle of host publicationICIEIS 2011
EditorsAzizah Abd Manaf, Shamsul Sahibuddin, Rabiah Ahmad, Salwani Modh Daud, Eyas El-Qawashmeh
Place of PublicationBerlin
Number of pages14
ISBN (Electronic)978-3-642-25462-8
ISBN (Print)9783642254611
Publication statusPublished - 2011
EventInternational Conference on Informatics Engineering and Information Science: ICIEI 2011 - Universiti Teknologi Malaysia, Kuala Lumpur, Malaysia
Duration: 14 Nov 201116 Nov 2011 (Event home page)

Publication series

NameCommunications in Computer and Information Science


ConferenceInternational Conference on Informatics Engineering and Information Science
CityKuala Lumpur
Internet address


Dive into the research topics of 'Data Compression Algorithms for Visual Information'. Together they form a unique fingerprint.

Cite this