A Fast and Robust Image Watermarking Scheme Using Improved Singular Value Decomposition

Luyen, Cao Thi; Cuong, Nguyen Hieu; At, Pham Van

doi:10.1007/978-3-662-49381-6_75

Cited by 1 publication

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the SVD based image watermarking schemes, first each segmented image block is decomposed into three matrices U, D and V (see 2.1). After that, watermarks can be embedded in different positions in the matrices: (1) in D [6,15,17,19,28] (2) in the first column U or V [4,13,28] or (3) in both D and U [2,7]. In various SVD based algorithms [2,6,8,10,13], only the first coefficient of D and the first column of U (or V) are used.…”

Section: Introductionmentioning

confidence: 99%

“…Since the transform is complex and must be employed to every block, this step is rather time consuming. Inspired by the work of [7], we show that in watermarking schemes, one does not need to compute SVD for image blocks in the conventional way, but only need to use the largest eigenvector and eigenvalue of the blocks. We proposed a new algorithm to directly compute the aforementioned values and utilize them in watermarking schemes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A robust public key watermarking scheme based on improved singular value decomposition

Luyen¹,

Cuong²,

At³

2017

ams

Self Cite

View full text Add to dashboard Cite

Digital watermarking has been considered as an effective solution for multimedia rightful protection and authentication. Singular value decomposition (SVD) is used for many watermarking schemes. This method has encountered some challenges, such as computational complexity and robustness. In this paper, instead of using the conventional SVD, we employed a new algorithm to directly compute the largest eigenvalue and eigenvector of segmented image blocks. Theoretically, by using this approach, our proposed watermarking scheme has computational complexity lower than various SVD based schemes. This improvement is essential for watermarking systems in practice, where ones often have to work with large-scale image datasets. Experimental results also showed that our watermarking scheme outperforms several widely used schemes in terms of robustness. Moreover, using the proposed algorithm, we designed a new robust public key watermarking scheme, where watermarked images can be verified without using the pre-defined watermark and a secret key.

show abstract