z-logo
open-access-imgOpen Access
Information Hiding Based on Histogram and Pixel Pattern
Author(s) -
Ari Moesriami Barmawi,
Deden Pradeka
Publication year - 2017
Publication title -
journal of cyber security and mobility
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.198
H-Index - 9
eISSN - 2245-4578
pISSN - 2245-1439
DOI - 10.13052/2245-1439.642
Subject(s) - histogram , steganography , cover (algebra) , embedding , pixel , information hiding , image (mathematics) , computer science , pattern recognition (psychology) , artificial intelligence , histogram matching , image histogram , computer vision , data mining , image processing , color image , engineering , mechanical engineering
Recently, information exchange using internet is increasing, such that information security is necessary for securing confidential information because it is possible to eavesdrop the information. There are several methods for securing the exchanged information such as was proposed by Rejani et al. Rejani’s method can be noiseless in low capacity but noisy in high capacity. In the case of high capacity, it will raise suspicion. This research proposed a method based on histogram and pixel pattern for keeping the stego image noiseless while still keeping the capacity high. Secret information can be embedded into the cover by evaluating the histogram and map the characters used in the secret message to the consecutive intensity in the cover image histogram. The map of the characters is sent to the recipient securely. Using the proposed method there is no pixel value changes during the embedding process. Based on the result of the experiments, it is shown that in noiseless condition, the proposed method has higher embedding capacity than Rejani’s especially when using cover image with sizes larger than 128 × 128. Thus, in noiseless condition the embedding capacity using the proposed method is higher than Rejani’s method in noiseless condition.  

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here