Affiliation:
1. School of Cyber Science and Engineering, University of International Relations, Beijing 100091, China
Abstract
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.
Funder
Research Funds for NSD Construction
Subject
Computer Networks and Communications,Information Systems
Reference36 articles.
1. Reversible data hiding;Z. C. Ni;IEEE Transactions on Circuits and Systems for Video Technology,2006
2. Reversible data hiding based on improved rhombus predictor and prediction error expansion;X. Tang
3. Reversible data hiding algorithm with high imperceptibility based on histogram shifting;L. N. Zhou
4. Improved Weighted Average-based Rhombus Predictor in Reversible Data Hiding Using Prediction Error Expansion
5. An improved image authentication method using QR code watermarking approach;X. M. Liu
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献