Improved Fluctuation Derived Block Selection Strategy in Pixel Value Ordering Based Reversible Data Hiding

Tang, Xin; Zhou, Linna; Tang, Guangming; Wen, Yuchen; Cheng, Yixuan

doi:10.1007/978-3-030-95398-0_12

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, a single complexity value is not utilized for both sides anymore. Furthermore, Tang et al [24] provided an improved scheme to further eliminate those invalid pixels. However, the average strategy is still utilized, which means each one of the neighbors is treated equally.…”

Section: Related Workmentioning

confidence: 99%

“…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%

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

Self Cite

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: Related Workmentioning

confidence: 99%