Reversible Data Hiding Scheme Based on Adjusting Pixel Modulation and Block-Wise Compression for Encrypted Images

Abstract

Reversible data hiding in encrypted image (RDHEI) is a technique that can provide the security and invisibility of their own information during the acquisition and sharing of them among multi-users. Among which, parametric binary tree labelling (PBTL) is a novel technique designed to serve for highcapacity RDHEI. However, considering the local smoothness of the image, its potential redundancy room has not been fully explored. In this paper, we propose an improved PBTL-RDHEI scheme (IPBTL-RDHEI in short). In IPBTL-RDHEI, an adjusting pixel modulation strategy is considered to reduce the probability of the overflow of pixels, making more embeddable pixels usage to carry secret data. Moreover, a blockwise rearrangement and compression (BRC) mechanism is introduced to decrease the length of the required auxiliary information. Experimental results confirm that the proposed scheme is able to achieve an average embedding rate as large as 1.827 bpp when the block size is set to 3×3. INDEX TERMS IPBTL-RDHEI, adjusting pixel modulation, block-wise rearrangement and compression (BRC), embedding rate.

Reversible Data Hiding Scheme Based on VQ Prediction and Adaptive Parametric Binary Tree Labeling for Encrypted Images

“…Fig. 11 lists the embedding rates of our scheme and six related works proposed in [18], [19], [20], [21], [22] and [23]. The embedding rates of the proposed scheme outperforms the related works in all cases except for the cover image 'man.'…”

“…According to the restorability of the cover media, data hiding techniques can be divided into two categories: reversible data hiding [1][2][3][4] and irreversible data hiding [5][6][7]. According to the format of cover images, the data hiding techniques for digital images can be applied to four different domains: the spatial domain [1][2][3][4][5][6][7], the frequency domain [8][9][10], the compressed domain [11,12], and the encryption domain [13][14][15][16][17][18][19][20][21][22][23].…”

“…In 2019, Chen et al [21] proposed a scheme which transforms the block-based MSB planes into bits stream and compresses the stream using run-length coding to embed data. In 2020, Wang et al [22] proposed an adjusting pixel modulation strategy to reduce the occurrences of pixel value overflow and thus obtain more embeddable pixels. In 2020, an improved reversible data hiding scheme in encrypted images using parametric binary tree labeling (IPBTL-RDHEI) is proposed by Wu et al [23], which takes advantage of the spatial correlation in the entire original image but not in small image blocks to reserve room for hiding data.…”

Reversible Data Hiding in Encrypted Images Based on Block-Wise Multi-Predictor

“…In this section, we will briefly review some recently reported reversible data hiding in encrypted image works [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30] and introduce the process of improved Huffman coding using recursive splitting [31].…”

“…The RDHEI algorithm allows the data to be embedded into the encryption domain without knowing the original image information or the encryption key, and the original image must be losslessly reconstructed after the information is extracted. The existing RDHEI algorithms can be roughly divided into two categories: reserving room before encryption (RRBE) [15][16][17][18][19][20][21][22][23][24][25] and vacated room after encryption (VRAE) [26][27][28][29][30]. Although researchers have proposed many RDHEI algorithms, there are still some problems to be solved, such as the inability to achieve a high embedding rate, the inability to correctly extract all secret data, the inability to reconstruct image quality well, and others.…”