Search

Numerous reversible data hiding schemes have been proposed with the goal of ensuring both security and availability of the original image. However, in the case of medical images, there is a risk of information leakage and image distortion, which must be avoided. To address this issue, an innovative reversible data hiding scheme based on circular distance interpolation utilizing optimal pixel adjustment with error substitution has been proposed in this paper. This approach aims to conceal confidential information within an image while preserving its visual quality, enhancing capacity, improve security and achieve reversibility. Before embedding, the secret data has been scrambled using Arnold transform technique to enhance security of the proposed scheme. In circular distance interpolation, a circle has been drawn taking interpolated pixel as center with different radius. Data hiding capacity has been increased by extending the reference pixels of a circular area specially in complex regions. Then identify all reference pixels from the circular region and embed secret data bits into the interpolated pixels. Finally, substitution error, optimal pixel adjustment process and input value replacement strategies are applied on intermediate stego image to get a high imperceptible stego image. The proposed data hiding scheme has been measured using standard evaluation metrics such as PSNR(dB), payload (bpp) and SSIM using different circular areas with higher values than existing interpolation based reversible data hiding schemes. The proposed phenomenon highlighted the significant and valuable features of hidden data communication research, which includes the ability to ensure hidden communication, which are crucial in our modern high-tech lifestyle. This approach has many advantages and benefits for various sectors such as private organizations, government agencies, and the public. [ABSTRACT FROM AUTHOR]

Traditional PVO (Pixel Value Ordering) can embed at most two data bits in a row or column of a smooth image block, which is unable to fulfil current demands. To improve embedding capacity, we propose a reference pixel-based reversible data hiding scheme using multi-level PVO with PEE (Prediction Error Expansion) where more than two data bits can be embedded in a smooth block in each iteration while maintaining good visual quality and security. This scheme is different because it uses smooth block selection and takes bin difference (-1) into account when embedding secret data within more than two pixels. By choosing the neighbouring and current block's pixel, this technique determines the smooth block. The reference pixel-based Multi-Level PVO (MPVO) method enhances the embedding performance as well as the image quality. With a block size of μ = (3 × 3 ), the suggested technique has an average embedding capacity (EC) of over 70,000 bits and an average PSNR of over 40 dB. The experimental results shows that the proposed scheme is relatively greater in concentration with security, image quality and capacity of secrets than the other state-of-the-art schemes. The desired result highlighted certain impressive magnificent qualities in the areas of steganography, security controls, and digitally fraud identification, without which the development of technology would be severely hindered. This programme has significant benefits for both the public and private sectors in the areas of intellectual property rights and health care units. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Secure reversible watermarking schemes are essential for image authentication and tamper detection in medical, military and government applications. In this paper, a secure reversible color image watermarking scheme has been proposed considering the merits of three individual tools namely Local Binary Pattern (LBP), Lagrange Interpolation Polynomial (LIP) and Weighted Matrix (WM). The proposed reversible scheme has been designed to address the issues related to image authentication and tamper detection. Here, LBP operator is employed to generate Tamper Detection Code (TDC), LIP and WM are used to embed watermark within the sub-sampled images. Authentication is accomplished by utilizing an Authentication Code (AC), which is generated from binary string of watermark logo using a Secure Hash Algorithm (SHA-512). Repeated entry-wise-multiplication operations have been performed with each sub-sampled image block to increase the payload without affecting visual quality of the watermarked image significantly. Some standard NIST recommended steganalysis and attacks are conducted to evaluate its robustness and imperceptibility. It is observed that the developed scheme is secure and robust against several attacks as well as can detect tampered regions. Experimental results are compared with the state-of-the-art schemes to present the merits of our scheme. [ABSTRACT FROM AUTHOR]

In the context of Reversible Data Hiding scheme (RDH), twin image-based methods have been widely used in recent years. Pixels of any cover image block are organized in ascending order and then modify the largest and smallest pixel to embed hidden information exploiting Pixel Value Ordering (PVO) techniques. The DPVO (Directional PVO) has been utilized in three orientations such as a horizontal, vertical and crosswise line applied one after other. Meanwhile, center folding method compresses the valuable hidden information and then embedded it within pixels of dual stego-images through averaging. The proposed scheme embed more than two data bits positions in any row of the image block which is possible by introducing a new parameter α, which was not reported by other PVO based RDH schemes. The Embedding Capacity (EC) is improved without compromising visual quality when the secret information is embedded using the center folding strategy combining with the DPVO scheme. The proposed method uses different image block sizes to demonstrate the relationship between the data hiding rate with visual quality of the stego image. The experimental outcomes indicate that the suggested method is suitable to embed high amount of hidden data with a good visual quality, that can be assured by comparing with other state-of-the-art methods. The intended result highlighted some impressive sublime features in the field of image identification, manipulation and forgery detection in which technical life stunts. This system profits enormously from numerous aspects of government and the private sector including education, economic protection, defence, intellectual property rights. [ABSTRACT FROM AUTHOR]

This article encompasses an effective scheme regarding reversible data hiding methodology that is achieved as an objective when Reed-Solomon (RS) codes are employed on a color image. Insertion of two additional pixels is done within the block of 5 pixels through linear interpolation with a view to carry the remainder of encoding polynomial ε(x) when divided by generating polynomial ψ(x). The task of data embedding is done within the additional two pixels after the aforesaid color image is partitioned into R, G, B components. The secret data bits are positioned through error creation adjusting with the last three bits(LSB) of each pixel of the block to ensure almost exact quality of the image. The said hidden data can be extricated successfully by the intended receiver without any distortion whereas reconstruction of original cover image can be done. Indeed, better results in terms of quality is experienced after having compared the proposed methodology with similar schemes in vogue. Finally some standard steganographic analysis is employed to test the robustness of the obtained stego image. The intended outcome brought into limelight some remarkable sublime characteristics in the field of image authentication, tamper detection and digital forgery detection without which the technological life is stunted. Innumerable government and private sector facet including health care, commercial security, defence, intellectual property rights gets immensely benefited from this scheme. [ABSTRACT FROM AUTHOR]

Pixel Value Ordering (PVO) is an efficient data hiding scheme where pixels are ranked in ascending order within an image block and then modify minimum and maximum pixel value to embed secret data. The embedding capacity of existing PVO based data hiding schemes were limited to embed only two bits in a row of any block and unable to perform repeated embedding. To solve the existing problem, we have proposed a generalized directional PVO (DPVO) with varying block size. The original image is partitioned into blocks and then enlarged using image interpolation. A new parameter (α) is introduced and added with maximum pixel value and subtracted from minimum pixel value to maintain the order of the rank which is dependent on the size of the image block. To improve data hiding capacity, overlapped embedding has been considered in three different directions (1) Horizontal, (2) Vertical and (3) Diagonal of each block. Experiments show that the proposed scheme has a good margin of performance compared with the state-of-the-art methods. Several steganographic analysis deemed robust against several attacks. [ABSTRACT FROM AUTHOR]

High capacity, secure, reversible watermarking scheme using a color image for image authentication and tampered detection is still an important area of research. In this investigation, we have proposed a weighted matrix based reversible watermarking scheme using the color image which provides image authentication and tampered detection. Here, we decomposed the original image into R, G, B color components and partitioned into (3 × 3) pixel blocks then we performed the sum of entry-wise-multiplication operations using a modified weighted matrix to embed the watermark. The watermark embedding locations are stored within an index file to enhance security, increase data hiding capacity, gain good visual quality, achieve reversibility and confirm authenticity. The proposed watermarking scheme not only perform authentication and tampered detection but also improved both data embedding capacity up to 8.00 (bpp) as well as increase visual quality measured by PSNR, 50.03 (dB). Finally, the scheme is compared with other existing state-of-the-art methods and gives a reasonably better performance in terms of visual quality and hiding capacity. Our scheme has been evaluated through various steganographic analysis and observed that the scheme is secure and robust against various attacks. [ABSTRACT FROM AUTHOR]

In this paper, a new reversible data hiding scheme has been proposed using lagrange’s interpolating polynomial on interpolated sub-sampled images. First, we generate sub-sampled images from original image and enlarge its size using image interpolation. Now, we convert secret message using lagrange interpolating polynomial and generate new secret message. The new secret message is divided and stored within interleaved pixel of each interpolated sub-sampled images. At the receiver end, new secret message is extracted from interleaved pixel of each sub-sampled stego images and then lagrange’s interpolation is applied to generate original secret message. The security has been enhanced due to the distributive nature of hidden data within multiple images. The original pixels are not effected during data embedding which assure reversibility. The proposed scheme provides average embedding capacity with good visual quality measured by peak signal to noise ratio (PSNR) which is greater than 50 dB. It is observed that the proposed scheme provides better performance than other existing data hiding schemes in terms of data embedding capacity, visual quality and security. We have analyzed our stego images through RS analysis, calculate relative entropy, standard deviation and correlation coefficient of original and stego image to show the robustness under various steganographic attacks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new dual-image based reversible data hiding scheme through (7,4) Hamming code (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 κ and one shared secret key ξ 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. [ABSTRACT FROM AUTHOR]

In this paper, we propose a partial reversible data hiding scheme using (7,4) Hamming code (PRDHHC) with secret position ( κ). In this scheme, we partition the original cover image into (7 × 7) pixel block and adjust redundant LSB bits of each row using odd parity. Then we calculate secret position κ = ( δ mod 7) + 1, where δ is a shared secret key. The bit at position κ 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 κ is updated by the data embedding position ( ω) of the previous row. We repeat this process to embed secret message bits within the selected block. For each new block, the κ is updated by κ = ( κ × δ × ω) mod 7 + 1, where i = 0, 1, 2, 3, . . . , number of blocks. At the receiver end, we complement the bit at position κ 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 κ and ω 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. [ABSTRACT FROM AUTHOR]