Please use this identifier to cite or link to this item:
http://ir.futminna.edu.ng:8080/jspui/handle/123456789/8792
Title: | Data Compression Algorithms for Visual Information |
Authors: | Kolo, J. G. seng, K. P. Ang, L.-M Prabaharan, SRS |
Keywords: | Lossless Image Compression Huffman coding Audio-Visual information Wireless Sensor Network |
Issue Date: | 2011 |
Citation: | J. G. Kolo, K. P. Seng, L.-M. Ang, SRS. Prabaharan, "Data Compression Algorithms for Visual Information", In: Communications in Computer and Information Science (CCIS), Volume 253(7), pp.484-497. Springer-Verlag Berlin Heidelberg 2011. (ISI/SCOPUS Cited Publication). http://www.springerlink.com/content/wl46t1mw16257445/ |
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. |
URI: | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/8792 |
Appears in Collections: | Electrical/Electronic Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Kolo_Data Compression Algorithms for Visual Information.pdf | 65.37 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.