New Video Watermark Scheme Resistant to Super Strong Cropping Attacks
- 1 School of Electronic Engineerin, Xidian University, Xi’an, China
- 2 School of Electronic Engineerin, Xidian University, Xi’an, China
- 3 School of Electronic Engineerin, Xidian University, Xi’an, China
- 4 School of Electronic Engineerin, Xidian University, Xi’an, China
Abstract
Firstly, the nonnegative matrix factorization with sparseness constraints on parts of the basis matrix (NMFSCPBM) method is proposed in this paper. Secondly, the encrypted watermark is embedded into the big coefficients of the basis matrix that the host video is decomposed into by NMFSCPBM. At the same time, the watermark embedding strength is adaptively adjusted by the video motion characteristic coefficients extracted by NMFSCPBM method. On watermark detection, as long as the residual video contains the numbers of the least remaining sub-blocks, the complete basis matrix can be completely recovered through the decomposition of the nonnegative matrix of the least remaining sub-blocks in residual videos by NMFSCPBM, and then the complete watermark can be extracted. The experimental results show that the average intensity resistant to the various regular cropping of this scheme is up to 95.97% and that the average intensity resistant to the various irregular cropping of this scheme is up to 95.55%. The bit correct rate (BCR) values of the extracted watermark are always 100% under all of the above situations. It is proved that the watermark extraction is not limited by the cropping position and type in this scheme. Compared with other similar methods, the performance of resisting strong cropping is improved greatly.
- H. Zhang, et al., “Affine Legendre Moment Invariants for Image Watermarking Robust to Geometric Distortions,” IEEE Transactions on Image Processing, Vol. 20, No. 8, 2010, pp. 2189-2199. doi:10.1109/TIP.2011.2118216
- C. V. Serdean, M. A. Ambroze, M. Tomlinso and J. G. Wade, “DWT-Based High-Capacity Blind Video Watermarking, Invariant to Geometrical Attacks,” IEEE Proceedings of the Vision, Image and Signal Processing, Vol. 150, No. 1, 2003, pp. 51-58. doi:10.1049/ip-vis:20030 159
- L. E. Coria, M. R. Pickering, P. Nasiopoulos and R. K. Ward, “A Video Watermarking Scheme Based on the Dual-Tree Complex Wavelet Transform,” IEEE Transactions on Information Forensics and Security, Vol. 3, No. 3, 2008, pp. 466-474. doi:10.1109/TIFS.2008.927421
- Y. L. Wang and A. Pearmain, “Blind MPEG-2 Video Watermarking Robust against Geometric Attacks: A Set of Approaches in DCT Domain,” IEEE Transactions on Image Processing, Vol. 15, No. 6, 2006, pp. 1536-1543. doi:10.1109/TIP.2006.873476
- X. M. Niu, et al., “A Video Watermarking against Geometrical Distortions,” Chinese Journal of Electronics, Vol. 12, No. 4, 2003, pp. 548-552.
- M. Silja and K. Soman, “A Watermarking Algorithm based on Contourlet Transform and Nonnegative Matrix Factorization,” Proceedings of the International Conference on Advances in Recent Technologies in Communication and Computing, Kottayam, 27-28 October 2009, pp. 279-281. doi:10.1109/ARTCom.2009.198
- A. D’Angelo, Z. P. Li and M. Barni, “A Full-Reference Quality Metric for Geometrically Distorted Images,” IEEE Transactions on Image Processing, Vol. 19, No. 4, 2010, pp. 867-881. doi:10.1109/TIP.2009.2035869
- Z. Y. Yang, et al., “Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization,” IEEE Transactions on Image Processing, Vol. 20, No. 4, 2011, pp. 1112-1125. doi:10.1109/TIP.2010.2081678
- M. Tong, T. Yan and H.-B. Ji, “Strong Anti-Robust WaterMarking Algorithm,” Journal of Xidian University, Vol. 36, No. 1, 2009, pp. 22-27.
- D. Gai, X. F. He, J. W. Han and T. S. Huang, “Graph Regularized Nonnegative Matrix Factorization for Data Representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 33, No. 1, 2011, pp. 1-13. doi:10.1109/TPAMI.2010.231
- T. Gao and M.-Y. He, “Using Improved Nonnegative Matrix Factorization with Projected Gradient for Single-Trial Feature Extraction,” Journal of Electronics & Information Technology, Vol. 32, No. 5, 2010, pp. 1121-1125.