Robust data hiding scheme for highly compressed image exploiting btc with hamming code

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) Hamming error 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 × 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) Hamming code whereas complex block remain unaltered. On the other hand, the Vertical Redundancy Check ( VRC ) 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.