Abstract
Reversible watermarking algorithms allow distortion–free recovery of the cover image after watermark extraction. Current state–of–the–art does not allow the prediction of the upper bounds of the embedding capacity and distortion characteristics of reversible watermarking algorithms for a given image. In this work, we develop a statistical modelling technique to derive closed form expressions for upper bounds on these performance metrics of pixel–prediction based reversible watermarking algorithms, independent of the actual algorithm used. Comparison of the derived metrics and performance trends with those obtained from two recently reported reversible watermarking algorithms show that the developed model is accurate and consistent.
Similar content being viewed by others
References
Cox, I.J., Miller, M.L., Bloom, J.A., Fridrich, J., & Kalker, T. (2008). Digital Watermarking and Steganography. Morgan Kaufmann Publishers.
(1965) In Abramowitz, M., & Stegun, I. (Eds.), Handbook of Mathematical Functions. Applied Mathematics Series: National Bureau of Standards.
Bishop, C.M. (2006). Pattern Recognition and Machine Learning. New York: Springer–Verlag.
Lin, C.J., Weng, R.C., & Keerthi, S.S. (2008). Trust region Newton method for large-scale logistic regression. Journal of Machine Learning Research, 9, 627–650.
Feng, J.B., Lin, I.C., Tsai, C.S., & Chu, Y.P. (2006). Reversible Watermarking: Current Status and Key Issues. International Journal of Network Security, 2(3), 161–171.
Fridrich, J., Goljan, M., & Du, R. (2002). Lossless Data Embedding – New Paradigm in Digital Watermarking. EURASIP Journal of Signal Processing, 2002(2), 185–196.
Hu, Y., Lee, H.K., & Li, J. (2010). DE–Based Reversible Data Hiding With Improved Overflow Location Map. IEEE Transactions on Circuits and Systems for Video Technology, 19(2), 250–260.
Wang, X., Li, X., Yang, B., & Guo, Z. (2010). Efficient Generalized Integer Transform for Reversible Watermarking. IEEE Signal Processing Letters, 17(6), 567–570.
Li, X., Zhang, W., Gui, X., & Yang, B. (2013). A Novel Reversible Data Hiding Scheme Based on Two–Dimensional Difference–Histogram Modification. IEEE Transactions on Information Forensics and Security, 8 (7), 1091–1100.
Tai, W.L., Yeh, C.M., & Chan, C.C. (2009). Reversible Data Hiding Based on Histogram Modification of Pixel Differences. IEEE Transactions on Circuits and Systems for Video Technology, 19(6), 906–910.
Lin, C.C., Tai, W.L., & Chang, C.C. (2008). Multilevel Reversible Data Hiding based on Histogram Modification of Difference Images. Pattern Recognition, 41(12), 3582–3591.
Yang, B., Schmucker, M., Funk, W., Busch, C., & Sun, S. (2004). Integer DCT–based Reversible Watermarking Technique for Images using Companding Technique. Proceedings of SPIE, 5306, 405–415.
Luo, L., Chen, Z., Chen, M., Zeng, X., & Xiong, Z. (2010). Reversible Image Watermarking using Interpolation Technique. IEEE Transactions on Information Forensics and Security, 5(1), 187–193.
Naskar, R., & Chakraborty, R.S. (2012). Reversible Watermarking Utilizing Weighted-median based Prediction. IET Image Processing, 6(5), 507–520.
Sachnev, V., Kim, H.J., Nam, J., Suresh, S., & Shi, Y.Q. (2009). Reversible Watermarking Algorithm Using Sorting and Prediction. IEEE Trans. on Circuits and Systems for Videotechnology, 19(7), 989–999.
Dragoi, C., & Coltuc, D. (2012). Improved Rhombus Interpolation for Reversible Watermarking by Difference Expansion. In 20th European Signal Processing Conference (EUSIPCO 2012).
Lin, S., & Costello, D. J. (2004). Error Control Coding (2nd edition): Prentice Hall.
Sobolewski, J. (2003). Cyclic redundancy check. Encyclopedia of Computer Science, 476–479.
Author information
Authors and Affiliations
Corresponding author
Appendix: Detailed Derivations
Appendix: Detailed Derivations
The general form of a linear combination of k Gaussian functions (Gaussian–k), generated by the MATLAB Curve Fitting Toolbox, is:
In this paper, functions f p and f Δ are empirically estimated as a linear combination of multiple Gaussian functions, i.e. f p =f k(p) and f Δ=f l(Δ) respectively, where 1≤k,l≤8.
In this section, we derive the general forms of the results presented in Eqs. 30 and 37, for E[C a p a c i t y] and E[M S E] respectively. In our derivations the following two standard integrals [2] have been used:
where e r f(x) is a special mathematical function called the Error Function [2], which is defined as \(erf(x)= \frac {2}{\sqrt {\pi }} {\displaystyle {\int }_{0}^{x}} e^{-t^{2}} \,dt\).
Next we compute six integrals I 1 through I 6, using Eqs. A.2 and A.3 above, which will be useful in the subsequent steps to derive the closed form expressions for E[C a p a c i t y] and E[M S E].
I 3 is evaluated by repeated application of the rule of integration by parts:
We find the next three integrals I 4, I 5, I 6 as definite integrals, with their upper and lower limits of integration set to U and L respectively.
Finally, we derive the general, closed form expressions for E[C a p a c i t y] and E[M S E] in terms of I 1, I 2 ⋯ I 6, from the results of Eqs. 30 and 37 respectively. In our derivations, f p and f Δ are considered as linear combinations of k and l Gaussian functions respectively (1≤k,l≤8). By Eq. 30,
By Eq. 37,
Rights and permissions
About this article
Cite this article
Naskar, R., Chakraborty, R.S. A Technique to Evaluate Upper Bounds on Performance of Pixel–prediction Based Reversible Watermarking Algorithms. J Sign Process Syst 82, 373–389 (2016). https://doi.org/10.1007/s11265-015-1009-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-015-1009-1