High Capacity Reversible Data Research Articles

An enhanced reversible patient data hiding algorithm for E-healthcare

The feasibility of future developments in computing technologies strongly relies on the existence of key technologies and their deployments. One of the areas where they are being deployed is telemedicine, it requires communication of patient report to a specialized doctor in a real time scenario. Therefore, any harm to patient medical data can lead to a faulty diagnosis that can be lethal for the patient. To ensure safe and secure communication in E-healthcare framework, a high capacity reversible data hiding algorithm in the encrypted domain has been proposed in this paper. The proposed algorithm gives a higher embedding rate by embedding n binary bits of patient data in basek numeral framework at every pixel of the cover image without any occurrence of underflow and overflow problem. In addition to electronic patient information (EPI), a fragile watermark has been embedded for observing any tamper to the patient data during transmission phase. The experimental study reveals that for all types of test images, proposed method has an embedding rate nearly twice larger than the compared methods, precisely recover EPI with a PSNR value of ∞ dB between the cover image and reconstructed image successfully.

High capacity reversible data hiding in encrypted images using SIBRW and GCC

In this paper, a reversible data hiding in encrypted images (RDHEI) method combining GCC (group classification encoding) and SIBRW containing sixteen image-based rearrangement ways is proposed to achieve high-capacity data embedding in encrypted images. Each way of SIBRW aims at bringing strongly-correlated bits of each higher bit-plane together by rearranging each higher bit-plane. For each higher bit-plane, the optimal way achieving the most concentrated aggregation performance is selected from SIBRW to rearrange this bit-plane, and then, GCC compresses the rearranged bit-plane in group-by-group manner. By making full use of strong-correlation between adjacent groups, GCC can compress not only consecutive several groups whose bits are valued 1 (or 0) but also a single group so that a large embedding space is provided. The encryption method including the bit-level XOR-encryption and scrambling operations enhances the security. The experimental results show that the proposed scheme can achieve large embedding capacity and high security.

High-Capacity Reversible Data Hiding in Encrypted Images by Information Preprocessing

With the development of cloud computing, high-capacity reversible data hiding in an encrypted image (RDHEI) has attracted increasing attention. The main idea of RDHEI is that an image owner encrypts a cover image, and then a data hider embeds secret information in the encrypted image. With the information hiding key, a receiver can extract the embedded data from the hidden image; with the encryption key, the receiver reconstructs the original image. In this paper, we can embed data in the form of random bits or scanned documents. The proposed method takes full advantage of the spatial correlation in the original images to vacate the room for embedding information before image encryption. By jointly using Sudoku and Arnold chaos encryption, the encrypted images retain the vacated room. Before the data hiding phase, the secret information is preprocessed by a halftone, quadtree, and S-BOX transformation. The experimental results prove that the proposed method not only realizes high-capacity reversible data hiding in encrypted images but also reconstructs the original image completely.

High capacity reversible and secured data hiding in images using interpolation and difference expansion technique

Data hiding is a noteworthy research topic in digital technology for years. Reversible data hiding (RDH) technique plays a vital role for confirming security of the digital transmissions. A new 2-layer secure, high capacity reversible data hiding technique has been proposed, using the concept of interpolation based data hiding and difference expansion method. Unlike, state-of-the art interpolation based RDH techniques, the security has been enhanced in the proposed technique by concealing the data into the image pixels in non-sequential manner. This technique offers high-capacity data hiding, by considering the maximum difference between neighboring pixels without compromising on quality of the images. It can embed up to 3.19 bpp in Baboon image which is better than the other existing state-of-the art interpolation based RDH (IRDH) techniques. The proposed technique is sustainable against the series of tests provided by standard StirMark Benchmark 4.0 analysis. It withstands the steganalysis attacks, viz., StegExpose as a measure of security.

High-capacity PVO-based reversible data hiding scheme using changeable step size

Reversible data hiding (RDH) algorithm based on pixel-value-ordering (PVO) has received widespread attention because of its excellent performance. PVO algorithm divides the host image into non-overlapped equal-sized blocks, then achieves data embedding by modifying the maximum and minimum values of each block. Every pixel block can be a host of watermark data, so the smaller number of pixel blocks limit the embedding capacity (EC). In our work, a novel PVO with changeable step size (CPVO) is presented which can choose suitable step size based on the number of watermark data bits, even that allow one block to overlap other ones. Take the block size 2 × 2 as an example, we can set step size 2 × 1 or another one in CPVO. Consequently, with a block selection skill based on the noise level (NL) of a pixel block, CPVO can embed more hidden data bits into a host image. Compared to the original PVO-based schemes, experimental results show that our proposed scheme increases the EC by 2 ∼ 3 times, and the marked image quality keeps much higher, even outperforms some other state-of-the-art works in some test images.

High Capacity Reversible Data Hiding Based on the Compression of Pixel Differences

In this paper, we proposed a novel reversible data hiding method in encrypted image (RDHEI), which is based on the compression of pixel differences. In the proposed method, at the content owner’ side the image is divided into non-overlapping blocks, and a block-level image encryption scheme is used to generate the encrypted image, which partially retains spatial correlation in the blocks. Due to the spatial correlation, in each block the pixels are highly likely to be similar. Therefore, the pixel differences in all blocks are concentrated in a small range and can be compressed. By the compression of pixel differences, the data hider can vacate the room to accommodate secret data in the encrypted image without losing information. At the receiver’s side, the receiver can obtain secret data or retrieve the original image using different keys with no error. The experimental results demonstrate that, compared with existing methods, the proposed method can achieve a higher capacity and visual quality.

A High-Capacity Reversible Data Hiding in Encrypted Images Employing Local Difference Predictor

This paper presents a reversible data hiding in encrypted image (RDHEI), which divides image into non-overlapping blocks. In each block, central pixel of the block is considered as leader pixel and others as follower ones. The prediction errors between the intensity of follower pixels and leader ones are calculated and analyzed to determine a feature for block embedding capacity. This feature indicates the amount of data that can be embedded in a block. Using this pre-process for whole blocks, we vacate rooms before the encryption of the original image to achieve high embedding capacity. Also, using the features of all blocks, embedded data is extracted and the original image is perfectly reconstructed at the decoding phase. In effect, comparing to existent RDHEI algorithms, embedding capacity is significantly increased in the proposed algorithm. Experimental results confirm that the proposed algorithm outperforms state of the art ones.

High Capacity Reversible Data Hiding in Encrypted JPEG Images by Quadtree Compression and Prediction Error

High Capacity Reversible Data Hiding in Encrypted JPEG Images by Quadtree Compression and Prediction Error

High capacity reversible data hiding in encrypted image based on image encoding and POB

Reversible data-hiding in encrypted image (RDH-EI) can be used for protection of original image by image owner; data hider can embed secret data in the encrypted image without necessity of knowing the original image content. In order to enhance the capacity of embedding in encrypted image, a novel RDH-EI framework based on JPEG-LS and permutation ordered binary (POB) number system is proposed. In the proposed scheme, the original image is first encoded by JPEG-LS, and then the encoded image is encrypted by bit planes. In the phase of data hiding, the encrypted image is first shuffled, and then non-encoded encrypted pixels are totally replaced by the secret data. Lastly, the above generated image is divided into some non-overlapping 2 × 2 blocks, the block feature of 3-bits which is calculated from the pixels within the block and 5-bits secret data are embedded into the every pixel of the block, and then the pixels with 10-bits data in the block are transformed into the POB value. Experimental results show that the proposed scheme obtains the higher embedding rate compared with some of the state-of-the-art schemes, the weak robustness and performance of verification for tampered parts in the marked image are also achieved for the proposed scheme.

High Capacity Reversible Data Hiding in Encrypted Image Based on Intra-Block Lossless Compression

The cover image is generally encrypted by a stream cipher in existing reversible data hiding in encrypted image (RDHEI) methods. As pixel correlation is seriously damaged, more than one pixel should be employed to carry one bit such that the quite limited capacity is achieved. To overcome this issue, a new RDHEI method with high capacity, that preserves pixel correlation and exploits it to vacate embedding room, is proposed in this paper. First, we propose a block-level encryption scheme which combines block-level stream cipher and block-level permutation, and all blocks are classified into usable blocks (UBs) and unusable blocks (NUBs) by preserving the correlation of pixels in blocks. Then, UB is reconstructed to vacate room for data embedding, because the pixels in blocks share the same most significant bits (MSBs). To ensure reversibility, the number of NUBs between current UB and the previous one is also embedded along with additional data, and the blocks are rearranged in a reversible way such that UBs are always in front of NUBs. Experimental results show that not only the embedding capacity is significantly improved but also the hidden data can be losslessly extracted, and the cover image can be perfectly recovered.

I-PVO based high capacity reversible data hiding using bin reservation strategy

Improved Pixel-Value-Ordering (I-PVO) based reversible data hiding scheme provides high-fidelity watermarked images with high data embedding capacity. In this paper, a new reversible data hiding scheme based on the I-PVO method is proposed to increase the data embedding capacity. The proposed scheme first divides the cover image into non-overlapping blocks of size 2 × 2 pixels uniformly, and then increases and decreases the values of highest and lowest pixels by one respectively. The proposed modification rules are used to reserve two bins which are used to increase the data hiding capacity. The pixels are sorted in ascending order to calculate two differences in the block. The difference values are calculated by considering pixel values along with their locations in the original block and are utilized to embed secret data in the highest and lowest pixel values using the proposed modification rules. While embedding the secret data, the pixel values are either increased/decreased or left unchanged according to the embedding bits. Thus, the proposed scheme embeds three bits per block in the cover image instead of two bits in the case of I-PVO on average. The experimental results show that the proposed scheme provides significantly higher data hiding capacity than the previous works.

A high capacity reversible data hiding through multi-directional gradient prediction, non-linear regression analysis and embedding selection

The technique of reversible data hiding enables an original image to be restored from a stego-image with no loss of host information, and it is known as a reversible data hiding algorithm (RDH). Our goal is to design a method to predict pixels effectively, because the more accurate the prediction is, the more concentrated the histogram is, and it minimizes shifting to avoid distortion. In this paper, we propose a new multi-directional gradient prediction method to generate more accurate prediction results. In embedding stage, according to the embedding capacity of information, we generate the best decision based on non-linear regression analysis, which can differentiate between embedding region and non-embedding region to reduce needless shifting. Finally, we utilize the automatic embedding range decision. With sorting by the amount of regional variance, the easier predicted region is prior for embedding, and the quality of the image is improved after embedding. To evaluate the proposed reversible hiding scheme, we compared other methods on different pictures. Results show that the proposed scheme can embed much more data with less distortion.

Matrix encoding-based high-capacity and high-fidelity reversible data hiding in HEVC

Nowadays, data hiding has become important for different reasons such as copyright violation and authentication. Conventional data hiding approaches may suffer from high capacity and high fidelity. In general, increasing capacity leads to distortion in carrier signal. In this paper, an efficient data hiding method, which has high capacity and high fidelity, is proposed for high-efficiency video coding. Hidden data are embedded into the coefficient of the discrete sine transforms at the transform domain level. The proposed method is basically based on matrix encoding approach that provides high capacity and high fidelity. In this paper, additionally, error propagation issue caused by data hiding is handled in the video encoding. Then, data hiding process is carried out without error propagation. Thus, distortion in visual quality is kept at minimum level during video encoding. Experimental results reveal that the proposed method exhibits outstanding performance in terms of visual quality and embedding capacity.

A Hybrid Reversible Data Hiding for Multiple Images With High Embedding Capacity

This paper proposed a high capacity reversible data hiding (RDH) scheme using three steganographic images, on which three successive embedding phases are performed. An embedding rule is elaborately designed to guide the data embedding and three alike stego-images are generated in the first phase. In view of the similarity of three stego-images, the pixel value ordering (PVO) strategy is utilized in the second phase. In the third phase, the prediction error histogram shifting (PEHS) strategy is employed by exploiting the slight difference among three temporary stego-images. Since no complex operation is involved, the algorithm is efficient. The experimental results verify that our method is superior to other schemes in both EC and image quality. Moreover, the proposed scheme can successfully resist the RS steganalysis and provide a secure secret transmission.

High Capacity Reversible Data Hiding for VQ-Compressed Images Based on Difference Transformation and Mapping Technique

In this paper, two reversible data hiding (RDH) methods for vector quantization (VQ)-compressed images are presented. In the first method, the difference-index table instead of the standard-index table is designed, and all difference indices are then classified into two groups, i.e., the to-be-mapped group and the candidate group, according to the occurrence frequencies of them. Afterwards, the mapping table between those two groups is adaptively constructed and used to serve for data embedding. Furthermore, another joint method is conducted by combining the standard-index based method and the difference-index based method, resulting in a better embedding performance. The experimental results confirm that both proposed methods, especially the joint method, are significantly superior to the most recent schemes in terms of the embedding capacity, bitrate and embedding rate.

A High Capacity Reversible Data Hiding in Encrypted AMBTC-Compressed Images

Recently, reversible data hiding in encrypted compressed images (RDHECI) has attracted more attention due to privacy information protection concerns. Meanwhile, AMBTC as one technique of lossy image compression that has lower storage costs and the simplicity in computation and is extensively used in many applications. Hence, this paper proposes an RDHECI scheme based on AMBTC, named O-AMBTC, to address privacy concerns. First, the original image is scrambled in a block-wise manner to generate the scrambled image which then is compressed by an AMBTC compression technique. Subsequently, the derived AMBTC compression codes are encrypted by using the methods of value modulation and stream cipher while the correlations between two quantization levels of AMBTC compression codes are retained and exploited to vacate redundant room to embed secret messages. Data hiding is then performed with the use of PBTL labeling strategy. In addition, another modified AMBTC compression code based RDHECI scheme, called M-AMBTC, is suggested to increase the ability to carry secret messages. In our dual approach, both the AMBTC-compressed image and the secret messages can be correctly recovered. Experimental results show that two proposed schemes are able to achieve average embedding rates as large as 0.6 bpp and 0.8 bpp when the block size is set to $2\times 2$ , respectively.

An efficient high-capacity reversible data hiding scheme for encrypted images

Reversible data hiding in encrypted images is an effective technique to embed information in encrypted domain, without knowing the original content of the image or the encryption key. In this paper, a high-capacity reversible data hiding scheme for encrypted images based on MSB (most significant bit) prediction is proposed. Since the prediction is not always accurate, it is necessary to identify the prediction error and store this information in the location map. The stream cipher is then used to encrypt the original image directly. During the data hiding phase, up to three MSBs of each available pixel in the encrypted image are substituted by the bits of the secret message. At the receiving end, the embedded data can be extracted without any errors and the original image can be perfectly reconstructed by utilizing MSB prediction. Experimental results show that the scheme can achieve higher embedding capacity than most related methods.

A New Kind of High Capacity and Security Reversible Data Hiding Scheme

A novel high capacity and security reversible data hiding scheme is proposed in this article, in which the secret data is represented by different orthogonal spreading sequences and repeatedly embedded into the cover image without disturbing each other in the light of Code Division Multiple Access (CDMA) technique, and thus the embedding capacity is enlarged. As most elements of orthogonal spreading sequences are mutually canceled in the process of repeated embedding, it keeps the distortion of the embedded image at a low level even with high embedding capacity. Moreover, only the receiver who has the spreading sequence and the embedding gain factor the same as the sender can extract the secret data and achieve the original image exactly, thus the proposed scheme achieves high embedding security than other schemes. The results of the experiment demonstrates that the CDMA based reversible data hiding scheme could achieve higher image quality at moderate-to-high embedding capacity compared with other state-of-the-art schemes.

High-capacity reversible data hiding in encrypted image based on specific encryption process

This paper proposes a novel reversible data hiding method in encrypted images based on specific encryption process. In the proposed specific encryption algorithm, the stream cipher and prediction error are combined to vacate room for data embedding. After that, a permutation operation is performed on the encrypted image to improve the security. In the embedding process, we can embed a large amount of secret data in the encrypted image by pixel value expansion because most of the pixel values are less than 128 by the specific encryption process. At the receiver end, the encrypted image can be recovered from the marked encrypted image without knowing the secret data. Therefore, even if the recipient only has the encryption key, the original image will be perfectly recovered. If the recipient only has the data-hiding key, the secret data will be extracted. And if the recipient has both keys, the original image and the secret data are both available. The proposed method achieves a higher embedding capacity than that of methods based on vacating room after encryption. It does not require the image owner to perform reversible data hiding techniques on the original image, which is more convenient than methods based on reserving room before encryption. Experimental results demonstrate that the proposed method outperforms other state-of-the-art methods.

High Capacity Reversible Data Hiding Technique Framed for Experimentation with PSO

In this paper we have studied the reversible data hiding techniques. We have seen previous techniques and also carefully analyzed the high capacity reversible data hiding method in MSB. We have proposed a model with particle swarm optimization which will work in future with HCRDH to ensure improvement in several parameters like precision and PSNR. We want to contribute towards a proposed method before actual experimentation and results are worked for.