In this paper, we propose a new dual-image based reversible data hiding scheme through (7,4) hammingcode (RDHHC) using shared secret key. A block of seven pixels are collected from cover image and copied into two arr...
详细信息
In this paper, we propose a new dual-image based reversible data hiding scheme through (7,4) hammingcode (RDHHC) using shared secret key. A block of seven pixels are collected from cover image and copied into two arrays then it is adjusted redundant Least Significant Bits (LSBs) using odd parity such that any error creation is encountered at the sender end and recovered at the receiver end. Before data embedding, we first complement the bit at shared secret position. After that, secret message bit is embedded by error creation caused by tamper in any suitable position except secret position and that error is detected as well as corrected at the receiver end using hamming error correcting code. One shared secret position kappa and one shared secret key xi help to perform data embedding, data extraction and recovery of the original image. The secret data and original cover image are successfully recovered at the receiver end from dual stego image. Finally, we compare our scheme with other state-of-the-art methods and obtain reasonably better performance in terms of PSNR.
Compression techniques can be used on digital content to minimize duplication and maintain internet traffic, while ensuring the quality of the decoded object. Two functionalities such as data concealing and images com...
详细信息
Compression techniques can be used on digital content to minimize duplication and maintain internet traffic, while ensuring the quality of the decoded object. Two functionalities such as data concealing and images compression can be combined into a single module, reducing the risk of responder attacks while improving execution efficacy. This study exploits Block Truncation Coding (BTC) with (7, 4) hammingerror correction and detection code to render a robust data hiding policy within highly compressed images. To compress the host image, BTC has been utilized which divides the image into (4 x 4) blocks. These blocks are categorized into two groups namely complex and smooth, based on threshold value where each smooth block accommodate two secret data bits encoded in it employing (7, 4) hammingcode whereas complex block remain unaltered. On the other hand, the Vertical Redundancy Check (V RC) approach greatly aids in determining the location of the hidden message bit. The cover or host image can be partially recovered due to the lossy property of BTC image compression scheme. To test its robustness and imperceptibility, several standard NIST approved steganalysis and statistical attacks are carried out. The developed technique is found to be secure and strong against a variety of geometrical attacks. The virtues of the proposed scheme are presented by comparing experimental results to the state-of-the-art schemes. The anticipated consequence highlighted certain outstanding magnificent aspects in the fields of verification of image, tamper recognition, and digital forgery sensing, all of which are essential to the contemporary technological life. This scheme benefits a wide range of government and business sectors, as well as health care, security, intellectual property rights, commercial and defense.
In this paper, we propose a partial reversible data hiding scheme using (7,4) hammingcode (PRDHHC) with secret position (kappa). In this scheme, we partition the original cover image into (7 x 7) pixel block and adju...
详细信息
In this paper, we propose a partial reversible data hiding scheme using (7,4) hammingcode (PRDHHC) with secret position (kappa). In this scheme, we partition the original cover image into (7 x 7) pixel block and adjust redundant LSB bits of each row using odd parity. Then we calculate secret position kappa = (delta mod 7) + 1, where delta is a shared secret key. The bit at position kappa and a suitable location for hidden message bit is modified through error creation caused by tamper in each row of the selected block. For the next row, the kappa is updated by the data embedding position (omega) of the previous row. We repeat this process to embed secret message bits within the selected block. For each new block, the kappa is updated by kappa (i+1) = (kappa (i) x delta x omega) mod 7 + 1, where i = 0, 1, 2, 3, ..., number of blocks. At the receiver end, we complement the bit at position kappa then retrieve the secret message bit by applying hamming error correcting code. The extraction process will be stopped when we find continuous no error within stego image. The propose PRDHHC scheme extract the hidden message successfully and recover hamming adjusted cover image by complement bits at both the kappa and omega positions but can not recover original cover image, that is to say, our scheme is partial reversible. Finally, we compared our scheme with other state-of-the-art methods and obtained reasonably better performance in terms of visual quality (measured by PSNR). Also we analyze our generated stego image using some steganalysis techniques which give promising results.
暂无评论