Dataset Information

High capacity reversible data hiding with interpolation and adaptive embedding.

ABSTRACT: A new Interpolation based Reversible Data Hiding (IRDH) scheme is reported in this paper. For different applications of an IRDH scheme to the digital image, video, multimedia, big-data and biological data, the embedding capacity requirement usually varies. Disregarding this important consideration, existing IRDH schemes do not offer a better embedding rate-distortion performance for varying size payloads. To attain this varying capacity requirement with our proposed adaptive embedding, we formulate a capacity control parameter and propose to utilize it to determine a minimum set of embeddable bits in a pixel. Additionally, we use a logical (or bit-wise) correlation between the embeddable pixel and estimated versions of an embedded pixel. Thereby, while a higher range between an upper and lower limit of the embedding capacity is maintained, a given capacity requirement within that limit is also attained with a better-embedded image quality. Computational modeling of all new processes of the scheme is presented, and performance of the scheme is evaluated with a set of popular test-images. Experimental results of our proposed scheme compared to the prominent IRDH schemes have recorded a significantly better-embedding rate-distortion performance.

SUBMITTER: Wahed MA

PROVIDER: S-EPMC6402661 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:The main challenge in steganography algorithms is balancing between the size of the secret message (SM) that is embedded in the cover image (CI) and the quality of the stego-image (SI). This manuscript proposes a new steganography algorithm to hide a large amount of secret messages in cover images with a high degree of non-perception in the resulting images. The proposed algorithm applied a multi-channel deep data hiding and extraction algorithm (MCDHEA) based on a modified multi-level steganography (MLS) approach. This approach used a new modification of the least significant bits (NMLSB) to make it hard to extract a secret message from attackers. The secret message was distributed among n-blocks; each block was hidden into a sub-channel that included multi-level hiding and flows into the main channel. Different grayscale images were used through the levels of each sub-channel and using the color image in the last level of the main channel. The image size of the multi-level was expanded from one level to the next level, and at each level, lossless image compression using the Huffman coding algorithm was applied to enable the size of the data hiding at the next level. In addition, the encryption of secret messages and intermediate cover images based on the XOR encryption algorithm is applied before the hiding process. Finally, the number of bits to be replaced at each level for both sub and main channels was four bits per byte except at the last level of the main channel based on a new approach using a non-uniform number of bits replacements. This algorithm's performance was evaluated using various measures. The results show that the proposed technique is effective and better than the previous works concerning imperceptibility and robustness. Furthermore, the results show that the maximum peak signal-to-noise ratio (PSNR) of 61.2 dB for the payload of 18,750 bytes, the maximum video information fidelity (VIF) of 0.95 for the payload of 19,660 bytes, and the maximum structural similarity index measure (SSIM) of 0.999 for the payload of 294,912 bytes.

Dataset Information

High capacity reversible data hiding with interpolation and adaptive embedding.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets