Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Lu, Wei; | Lu, Hongtao
Affiliations: Department of Computer Science and Guangdong Key Laboratory of Information Security Technology, Sun Yat-sen University, Guangzhou 510275, China | Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China, e-mail: [email protected], [email protected]
Abstract: This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a subimage sequence. Then, based on the column similarity of the subimage sequence, nonnegative matrix factorization (NMF) is applied to decompose the sequence. A Gaussian pseudo-random watermark sequence is embedded in the factorized decomposition coefficients. Because of the high similarity of subimages and meaningful factorization for NMF, the proposed scheme can achieve good robustness, especially to common permutation attacks. Numerical experiment results demonstrate the good performance of the proposed scheme.
Keywords: watermarking, nonnegative matrix factorization, DWT
Journal: Informatica, vol. 19, no. 4, pp. 555-566, 2008
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]