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

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 impl...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 801; no. 1; pp. 12059 - 12062
Main Authors Rachmawati, D, Amalia, A, Surya, J
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.01.2017
Subjects
Algorithms
Color coding
Huffman codes
Image compression
Physics
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/801/1/012059

Cover

More Information
Summary: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%.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/801/1/012059