Random Matching Pursuit for Image Watermarking

被引:19
作者
Hua, Guang [1 ]
Zhao, Lifan [2 ]
Zhang, Haijian [1 ]
Bi, Guoan [3 ]
Xiang, Yong [4 ]
机构
[1] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Hubei, Peoples R China
[2] AStar, Inst Infocomm Res, Singapore 138632, Singapore
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Deakin Univ, Sch Informat Technol, Burwood, Vic 3125, Australia
基金
中国国家自然科学基金;
关键词
Data hiding; watermarking; matching pursuit; random matching pursuit; underdetermined system; SPREAD-SPECTRUM; ROBUST; MODULATION; RESILIENT; SCHEME;
D O I
10.1109/TCSVT.2018.2809585
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The classical solution to an underdetermined system of linear equations mainly has two opposite directions, which lead to either a large l(2)-norm sparse solution or a non-sparse minimum l(2)-norm solution. In this paper, we systematically show that by modifying the well-known basic matching pursuit algorithm originally proposed to identify the sparse solution, an alternative solution between the two classical ones could be obtained. The modified algorithm, termed as random matching pursuit (RMP), is then used to create a novel image watermarking framework. Compared to conventional systems, the security is substantially improved by the use of random over-complete dictionaries and the order parameter of RMP. Capacity can also be increased thanks to the transform with over-complete dictionaries that could expand signal dimension. Meanwhile, imperceptibility and robustness properties of the proposed design framework are not compromised. The classical spread spectrum and improved spread spectrum techniques are applied to the proposed framework for practical implementations. The novelty and effectiveness of the proposed systems are supported by rigorous performance analysis and experimental results using an image data set. This paper reveals the potential of using over-complete dictionaries in multimedia watermarking systems, which theoretically leads to the exploration of alternative candidates among the infinite solutions to underdetermined linear systems other than minimum l(2)-norm and sparse ones.
引用
收藏
页码:625 / 639
页数:15
相关论文
共 38 条
[1]   Bayesian Compressive Sensing Using Laplace Priors [J].
Babacan, S. Derin ;
Molina, Rafael ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (01) :53-63
[2]   A New Measure of Watermarking Security: The Effective Key Length [J].
Bas, Patrick ;
Furon, Teddy .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2013, 8 (08) :1306-1317
[3]   Robust image watermarking based on multiband wavelets and empirical mode decomposition [J].
Bi, Ning ;
Sun, Qiyu ;
Huang, Daren ;
Yang, Zhihua ;
Huang, Jiwu .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2007, 16 (08) :1956-1966
[4]   MPSteg-Color: Data Hiding Through Redundant Basis Decomposition [J].
Cancelli, Giacomo ;
Barni, Mauro .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2009, 4 (03) :346-358
[5]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[6]   Quantization index modulation: A class of provably good methods for digital watermarking and information embedding [J].
Chen, B ;
Wornell, GW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1423-1443
[7]   A Perceptually Tuned Watermarking Scheme for Color Images [J].
Chou, Chun-Hsien ;
Liu, Kuo-Cheng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (11) :2966-2982
[8]  
Cox IJ, 2008, MKS MULTIMED INFORM, P1
[9]   Secure spread spectrum watermarking for multimedia [J].
Cox, IJ ;
Kilian, J ;
Leighton, FT ;
Shamoon, T .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (12) :1673-1687
[10]  
Cox IJ, 2006, LECT NOTES COMPUT SC, V4283, P1