Reducing the Computational Complexity of the Reference-Sharing Based Self-embedding Watermarking Approach
Reference-sharing based self-embedding watermarking schemes had been shown to be an effective way to avoid the tampering coincidence and the reference waste problems. Typical reference-sharing based schemes adopt pseudo-random binary matrices as the encoding matrices to generate the reference information. This paper investigate to reduce the computational complexity of the reference-sharing based self-embedding watermarking approach by using the sparse binary matrices as the encoding matrices. Experimental results demonstrate the proposed approach can reduce the computational complexity significantly while maintaining the same tampering restoration capability as the traditional.
KeywordsSelf-embedding watermarking Computational complexity Tamper detection and recovery Sparse matrices
This research is supported in part by the National Natural Science Foundation of China (NSFC) (No. U1536110).
- 1.Fridrich, J., Goljan, M.: Images with self-correcting capabilities. In: International Conference on Image Processing, ICIP 1999 Proceedings, vol. 3, pp. 792-796. IEEE (1999)Google Scholar
- 3.Zhang, X., Xiao, Y., Zhao, Z.: Self-Embedding Fragile Watermarking Based on DCT and Fast Fractal Coding. Kluwer Academic Publishers, Hingham (2015)Google Scholar
- 6.Singh, D., Singh, S.K.: Effective Self-Embedding Watermarking Scheme for Image Tampered Detection and Localization with Recovery Capability. Academic Press, Inc., Orlando (2016)Google Scholar