IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 4    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 4,April 2012
An Improved Approach for Spatial Domain Lossless Image Data Compression Method by Reducing Overhead Bits
Full Text(PDF, )  PP.700-703  
Mahmud Hasan, Kamruddin Md. Nur
— Bits Per Pixel (BPP), Block Matrix, Block Processing, Computational Overhead, Inter-Pixel Redundancy, Run Length Coding, Spatial Domain Lossless Image Compression
Lossless image compression techniques are used in digital imaging where large amount of data is to be stored without compromising the image quality. The volume of data that can be compressed using lossless image compression schemes is usually much lesser than that of its lossy compression counterparts. Yet, however, lossless compression algorithms are popular in a number of particular image data storage sectors. To meet the increasing demand of large amount of high quality image data storing, numerous algorithms were developed during last few decades featuring lossless image compression and covering various aspects of data compression approaches. Spatial domain lossless image compression methods are popular in most respects since their computational time is comparatively much lesser. In this paper, we focus on a spatial domain image compression technique that uses simple arithmetic operations in order to achieve the specified goal. We revealed that the mentioned algorithm is not always as advantageous as other spatial domain compression systems and often suffers from overhead transmission of unnecessary image data. The thorough investigation over the technique is reported along with the discovered mathematical bound at which the algorithm of interest is failed to achieve the desired target. Finally, to reduce the overhead obtained as a result of algorithmic trouble, an improved mechanism is suggested so that both the transmission time and storage space requirements using this method is facilitated
[1] Gregory K. Wallace, “The JPEG Still Picture Compression Standard”, IEEE Transactions on Consumer Electronics, 1991.

[2] Ralf Steinmetz and Klara Nahrstedt, “Multimedia: Computing, Communications and Applications”, 1st Edition, Pearson Education Inc. ISBN: 81-7808-319-1, 2005.

[3] Suneetha Agarwal and Seshagiri Gurram, “Image Compression using Simple Arithmetic Operations”, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA), India, pp. 58-62, 2007.

[4] Sunil Kumar Pattanik, K. K. Mahapatra and G. Panda, “A Novel Lossless Image Compression Algorithm using Arithmetic Modulo Operation”, IEEE International Conference on Cybernetics & Intelligence Systems (CIS) and Robotics Automation & Mechatronics (RAM) (CISRAM 2006), Thailand, pp. 234-238, 2006.

[5] Komal Ramteke and Sunita Rawat, “Lossless Image Compression LOCO-R Algorithm for 16 bit Image”, 2nd National Conference on Information and Communication Technology (NCICT), pp. 11-14, 2011.

[6] Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, 2nd Edition, Pearson Prentice Hall. ISBN: 81-7758-168-6, 2005.

[7] Syed Ali Hassan and Mehdi Hussain, “Spatial Domain Lossless Image Data Compression Method”, International Conference of Information and Communication Technologies, 2011.

[8] Tinku Acharya and Ajoy K. Ray, “Digital Image Processing: Principles and Applications”, John Wiley & Sons, Inc. ISBN: 10 0-471-71998-6, 2005.

[9] M. Nelson and J. L. Gailly, “The Data Compression Book”, 2nd ed. New York: M & T Books, 1996.

[10] Al-Wahaib and M. S. KokSheikh Wong, “A Lossless Image Compression Algorithm Using Duplication Run Length Coding”, IEEE Conference on Network Application Protocols and Services, pp. 245-250, 2010.

[11] J P Cookson and G R Thoma, “X-Ray Image Compression using Run Length Coding”, Journal of Medical Systems, Volume: 12, Issue: 4, pp. 201- 209, 1988.

[12] Samir Kumar Bandyopadhyay, Tuhin Utsab Paul and Avishek Raychoudhury, “Image Compression using Approximate Matching and Run Length”, International Journal of Advanced Computer Science and Applications (IJACA), Volume: 2, Issue: 6, pp. 117-121, 2011.s

Untitled Page