Difference between revisions of "Watermarking"
(SVD approach) |
DavidB4-bot (talk | contribs) (→top: Category) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 4: | Line 4: | ||
In recent years [[linear algebra]] has provided new methods for watermarking. Specifically, the technique of [[Singular Value Decomposition]] enables more powerful and sophisticated watermarking that is resistant to attack. | In recent years [[linear algebra]] has provided new methods for watermarking. Specifically, the technique of [[Singular Value Decomposition]] enables more powerful and sophisticated watermarking that is resistant to attack. | ||
| − | [[ | + | [[Category:Mathematics]] |
| + | [[Category:Linear Algebra]] | ||
Latest revision as of 14:36, July 28, 2016
Watermarking, or data hiding, consists of embedding a typically invisible identifier into an image, video or audio file for security reasons.
Watermarking requires both embedding and extraction algorithms. Mathematical techniques can include least-significant bit encoding, transform or image-adaptive techniques and basic M-sequence.
In recent years linear algebra has provided new methods for watermarking. Specifically, the technique of Singular Value Decomposition enables more powerful and sophisticated watermarking that is resistant to attack.