Bitplanes Block Based Exact Image Compression

International Journal of Engineering and Information Systems (IJEAIS) 2 (10):18-26 (2018)
  Copy   BIBTEX


Abstract: In this paper, an exact image compression based on bit-planes blocking is proposed. The proposed algorithm uses two bit codes for block representation. The codes represent the states of Unicode block and non-Unicode. The algorithm considers further division to non-Unicode block. The block division continues until the smallest block size which are kept as residuals. The smallest block size in the study is two by two. The main process of encoding consumed three codes. Subsequent process uses the fourth code for further compression. The resultant file is subject to further exact compression. The compression technique considered in this study is Huffman. The compression-decompression implementation complexity is comparable with the well-known methods. Also, the compression ratio for the algorithm is comparable with well-known methods. The algorithm parallelization is straightforward and dependent on number of planes. Within a plane, the process hardware realization is simple and does on require special hardware.



External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Bitplanes Block Based Lossy Image Compression.Abdelatief H. Abouali - forthcoming - International Journal of Academic Engineering Research (IJAER) 2 (10):19-27.
Image Compression Based on Block SVD Power Method.Khalid El Asnaoui - 2019 - Journal of Intelligent Systems 29 (1):1345-1359.
Algorithmic compression of empirical data: reply to Twardy, Gardner, and Dowe.James Mcallister - 2005 - Studies in History and Philosophy of Science Part A 36 (2):403-410.


Added to PP

324 (#64,897)

6 months
89 (#56,099)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references