An Efficient Two- Stage Block Coding Method for Compression Binary Images
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2018 by IJETT Journal|
|Year of Publication : 2018|
|Authors : Yasir Ali Matnee
|DOI : 10.14445/22315381/IJETT-V55P209|
Yasir Ali Matnee "An Efficient Two- Stage Block Coding Method for Compression Binary Images", International Journal of Engineering Trends and Technology (IJETT), V55(1),41-44 January 2018. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Efficient image compression without quality loss is one of important problems of the information theory. This problem has a wide practical application. It is known that any digital image can be represented by a sequence of messages. The only requirement for these methods is the possibility of restoring an exact copy of the original image from a sequence of messages . One of the ways of choosing messages is that the adjacent picture elements are grouped into blocks. Then, these blocks are encoded according to the probabilities of their occurrence. Thus, short codewords are used for the most probable configurations of blocks, and long code words are used for less probable configurations. The result is an average ratio of data compression. The block coding method makes it possible to obtain efficient compression binaryimages without losing quality. This paper considers the solution of this problem. We consider any binary image as many adjacent rectangular blocks of a certain size. Using the optimal Huffman coding we can achieve the highest data compression. However, in blocks larger than 3×3 a set of messages is very large, and the Huffman code becomes inefficient. In addition, statistical analysis of binary images shows that a block consisting of white elements has high probability. Based on this observation and applying the known optimal code, this paper proposes an efficient two-stage block coding method for compression binary images. We found the optimal block size at the first stage of coding. We have also compared the experimental results of the compression ratio with the proposed algorithm and the block algorithm JPEG. The results have confirmed the efficiency of the proposed method.
 Mridul K. M., Seema L., Dr. Dheeraj S. “Lossless Huffman Coding Technique For Image Compression And Reconstruction Using Binary Trees,” IJCTA, pp. 76-79, 2012.
 Vasudev B., Konstantinos K. Image and Video Compression Standards: Algorithms and Architectures ,II edition ,kiuwer Academic Publisher , 2012,pp.319-389.
 Babu P., Sathappan S. Efficient lossless image compression using modified hierarchical prediction and context adaptive coding. Indian Jour. of Sc. and Tech., 2015, vol. 8, pp. 1-6.
 WatanabeT.,Sugawara K., Sugihara H., A new pattern representation scheme using data compression, 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence Volume: 24, Issue: 5.
 Coulon F., Jonsen O. Adaptive block scheme for source coding of black-and-white facsimile. Electron. Lett., 1976, vol. 12, no. 3, pp. 61-62.
 Bhavna P, Reena S, Mitul M, Tutorial review on existing image compression techniques, International Journal Of Engineering And Computer Science . 2014. Volume 3 Issue 8 pp. 7882-7889.
 Mamta S., Compression Using Huffman Coding,2010, International Journal of Computer Science and Network Security, VOL.10 No.5.
 Weinberger MJ, Seroussi G., Sapiro G. The LOCO-I lossless image compression algorithm: Principles and standartization into JPEG-LS. IEEE Trans. Image Process, 2000, vol. 9, no. 8, pp. 1310-1324.
 RyabkoB.Ya., Fionov A.N; Homophonic coding with logarithmic memory size. Algorithms and Computation, Springer, Berlin, 1997, pp. 253-262.
 Trofimov V. K., Efficiency of Output-Uniform Coding of Bernoulli Sources for Unknown Message Statistics, 2010, Avtometriya 46(6), 32–39.
binary image , block coding , compression ratio.