Combination of Huffman Coding Compression Algorithm and Least Significant Bit Method for Image Hiding

International Conference on Computing and Applied Informatics 2016

物理学;计算机科学

Rachmawati, D.^1 ; Amalia, A.^1 ; Surya, J.^1

Department of Computer Science, Faculty of Computer Science and Information Technology, University of Sumatera Utara, Jl. Universitas No. 9-A, Medan

20155, Indonesia^1

关键词: Colour value;    Compression algorithms;    File sizes;    Huffman coding;    Huffman coding algorithms;    Image hiding;    Least significant bits;    Red , green and blues;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/801/1/012059/pdf
DOI  :  10.1088/1742-6596/801/1/012059

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

Least Significant Bit method can be used to hide image data into another image, but it need 8 bytes of data to store 1 bit of data, therefore, to store an image with red, green and blue channel. It would require 24 times the size of the image itself. To solve the size problem in hiding data, we implement and experiment with Huffman Coding compression algorithm to reduce the size of the image data needed in C#. Our experimental results are as follows. First, the less colour value variation, Huffman Coding algorithm will give a better compressed size. Second, the average file size change in this research is 29.17%.