Efficient PVO-Based Reversible Data Hiding by Selecting Blocks With Full-Enclosing Context

Xiang, Shijun; Ruan, Guanqi

doi:10.1109/tcsvt.2021.3103215

Cited by 22 publications

(4 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, the actual performance is seriously restrained by the smoothness of selected blocks, which is defined to be their complexity value. Even though a lot of works [20][21][22][23][24] focus on this problem, the actually obtained result is not always accurate in reflecting the real smoothness. e main reason is that those invalid context pixels are still assigned too large a weight to participate in the calculation, which inevitably introduces a lot of uncertainty.…”

Section: Introductionmentioning

confidence: 95%

“…However, take the maximum side for example, once the largest and second largest pixels are positioned at the top left corner of the block, their difference actually cannot be inferred by context pixels which are faraway. To deal with the problem, Xiang et al [21] proposed a full-closed strategy to select context pixels. Specifically, nonoverlapped blocks are alternatively classified to two groups in a rhombus pattern.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Weighted Average-Based Complexity Calculation in Block Selection Oriented Reversible Data Hiding

Tang

Zhou

Cheng

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Complexity of blocks is one of the key factors to influence the performance of reversible data hiding. By embedding data into blocks with smaller complexity, the invalid shifting in pixel value ordering (PVO) based reversible data hiding is largely reduced, thus increasing the imperceptibility. However, the existing techniques are not always accurate in complexity calculation, since context pixels are usually treated equally. As a result, a great number of invalid pixels are assigned too large a weight in complexity calculation, which inevitably affects the precision. In this paper, we propose a weighted average based novel strategy in complexity calculation. In this scheme, we calculate the weight of a certain context pixel with the help of its adjacent neighbors, which ensures the one in a smooth area is assigned a larger weight, and otherwise the opposite. Experimental results show that invalid shifting is largely reduced, thus our scheme is better in imperceptibility compared with the state of the art and has potential application in a lot of fields such as medical imaging.

show abstract

Section: Introductionmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Weighted Average-Based Complexity Calculation in Block Selection Oriented Reversible Data Hiding

Tang

Zhou

Cheng

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Comparative analysis with the original pairwise PEE shows that He et al can effectively utilize the error correlation and thus achieve superior capacity distortion performance. Subsequent scholars have successively proposed many methods to further improve the embedding performance, such as PVO based on multiple histograms modiication [15][16][17], adaptive block complexity calculation [18,19], dynamical block size determination [20,21] and so on [22].…”

Section: Introductionmentioning

confidence: 99%

Multi-PVO for Reversible Data Hiding Based onFull Homomorphic Encryption

Ge,

Shen,

Xia

et al. 2024

Preprint

View full text Add to dashboard Cite

To enhance the embedding performance of reversible data hiding algorithms and bolster the security of data transmission processes, a novel pixel value ordering method based on full homomorphic encryption is proposed in this paper. First, we propose a multi-PVO method to improve the fidelity of images with equal embedding capacity. In addition, we propose a double layer encryption method and achieve Paillier's fully homomorphic encryption. In practice, the sender encrypts the original image and then transmits the ciphertext to the embedding side. The embedding side performs a multi-PVO method and data hiding based on homomorphism to seamlessly embed the data into the ciphertext. This implementation offers dual functionality. On the one hand, users with no private keys can directly embed or extract the secret data without decryption keys. On the other hand, users with private keys can decrypt the marked ciphertext and help retrieve the marked plaintext. Finally, utilizing multi-PVO for extraction or recovery, additional data or original image can be retrieved from the marked image at receiver. With 20,000 bits embedded, the PSNR of the image Lena is as high as 59.60 dB, which demonstrates great image quality with the same embedding capability.

show abstract

“…Finally, prediction error expansion (PEE) methods calculate prediction error of the pixel to be embedded by using neighboring pixels, and embed the secret data by expanding the error. For performance improvement, many pixel-valueordering methods have been actively tested recently [11][12][13][14][15]. However, because they were developed and optimized only for texture images, new techniques should be considered for other image formats.…”

Section: Introductionmentioning

confidence: 99%

Efficient Reversible Data Hiding Based on View Synthesis Prediction for Multiview Depth Maps

Lee

2024

IEEE Access

View full text Add to dashboard Cite

Multiview-plus-depth (MVD), which has been used as a 3D format, consists of a texture image and its corresponding depth map at each viewpoint. This MVD-based 3D format has two strong correlations, which are an inter-component correlation between a texture image and its corresponding depth map and an interview correlation between adjacent texture and depth views. However, conventional reversible data hiding (RDH) methods have been mainly developed for texture images. As a result, high performance could not be obtained in depth maps. In order to solve this problem, an efficient RDH method is proposed for multiview depth maps in this paper. The proposed RDH method checks inter-component and interview correlations, and uses inter-component and interview predictions adaptively to embed secret data in the depth map. In particular, a view synthesis prediction (VSP) method is used for the interview prediction. In addition, an allowable depth distortion range, which guarantees no synthesis distortion in virtual views, is calculated to minimize distortion of the depth map marked with the hidden data, while maintaining the high embedding capacity. Experimental results show that the proposed method achieves much higher performance than conventional methods in terms of the embedding capacity and the depth distortion.INDEX TERMS Depth map, multiview-plus-depth (MVD), reversible data hiding (RDH), view synthesis prediction (VSP).

show abstract

Efficient PVO-Based Reversible Data Hiding by Selecting Blocks With Full-Enclosing Context

Cited by 22 publications

References 44 publications

Weighted Average-Based Complexity Calculation in Block Selection Oriented Reversible Data Hiding

Weighted Average-Based Complexity Calculation in Block Selection Oriented Reversible Data Hiding

Multi-PVO for Reversible Data Hiding Based onFull Homomorphic Encryption

Efficient Reversible Data Hiding Based on View Synthesis Prediction for Multiview Depth Maps

Contact Info

Product

Resources

About