IMAGE COMPRESSION USING AREA SUB-DIVISION ALGORITHM RELYING ON QUADTREE

Authors

  • M Anand Kumar, D Demudubabu, Ch Mohan Babu

Abstract

This paper presents an image compression algorithm that has the ability to divide the original grey level image into unoverlapped blocks depending on a threshold value. The proposed algorithm is based on quadtree. It can compress and decompress the image in easy way using two stacks instead of tree. In the compression process, the proposed technique stores the information of all blocks, for instance the upper left coordinate, size, minimum, and difference values in a stack, and the divided blocks are numbered in effective way. This information will be used to decompress the image again. It was found that the algorithm provides a high compression ratio ranged between 0.12 and 0.68.

Article Metrics Graph

Chart Graph | Range Graph

Downloads

Published

2013-10-11

Issue

Vol. 2 No. 3 (2012): Asian Journal of Computer Science and Information Technology

Section

Articles

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”