International Conference on Information Communication and Embedded Systems (ICICES2014) 2014
DOI: 10.1109/icices.2014.7034015
|View full text |Cite
|
Sign up to set email alerts
|

Robust video watermarking algorithms based on Svd transform

Abstract: Video watermarking is a novel technology that has the ability to solve the problem of illegal digital video manipulation and distribution. In video watermarking, the copyright bits are embedded into video bit streams. This paper proposes two effective, robust and indiscerniblevideo watermarking algorithms. Both the algorithms of video watermarking are based on algebraic transform of Singular Value Decomposition (SVD). In the first algorithm, watermark information bits are embedded in the SVD-transformed video … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…The Hankel shift matrix extends infinitely beyond defining sequences X and Y, however, only the first two rows are required to define them. Singular value decomposition (SVD) is the factorization of a square or rectangular matrix into the product of three matrices [72]. SVD-based DMD [73] is used in this dissertation for its increased numerical stability when compared with the original DMD which is formulated in terms of a companion matrix as in [61].…”
Section: B Dynamic Mode Decompositionmentioning
confidence: 99%
“…The Hankel shift matrix extends infinitely beyond defining sequences X and Y, however, only the first two rows are required to define them. Singular value decomposition (SVD) is the factorization of a square or rectangular matrix into the product of three matrices [72]. SVD-based DMD [73] is used in this dissertation for its increased numerical stability when compared with the original DMD which is formulated in terms of a companion matrix as in [61].…”
Section: B Dynamic Mode Decompositionmentioning
confidence: 99%
“…In [18], the author computed the SVD of both the original image and the watermark image (logo) and then added singular values of the watermark images to those of the host image where the watermark W is added to the matrix S. Then, a new SVD process is performed on the new matrix: D = S + k*W, to get Uw, Sw, and Vw , where, k is a scale factor that controls the strength of the watermark embedded into the original image. The watermarked image Iw is then obtained by multiplying the matrices U, SW, and V. Many recent works that use the SVD transform to build watermarking systems can be found in [19][20][21].…”
Section: Related Workmentioning
confidence: 99%