Removable visible image watermarking algorithm in the discrete cosine transform domain

2008 ◽  
Vol 17 (3) ◽  
pp. 033008 ◽  
Author(s):  
Ying Yang
Keyword(s):  
Discrete Cosine Transform ◽  
Image Watermarking ◽  
Transform Domain ◽  
Visible Image ◽  
Cosine Transform

LWT-DCT based Image Watermarking Scheme using Normalized SVD

2020 ◽  
Vol 13 ◽  
Author(s):  
Rahul Dixit ◽  
Amita Nandal ◽  
Arvind Dhaka ◽  
Vardan Agarwal ◽  
Yohan Varghese
Keyword(s):  
Wavelet Transform ◽  
Singular Value Decomposition ◽  
Discrete Cosine Transform ◽  
Image Watermarking ◽  
Singular Value ◽  
Cover Image ◽  
Lifting Wavelet Transform ◽  
Cosine Transform ◽  
Lifting Wavelet ◽  
Value Decomposition

Background: Nowadays information security is one of the biggest issues of social networks. The multimedia data can be tampered with, and the attackers can then claim its ownership. Image watermarking is a technique that is used for copyright protection and authentication of multimedia. Objective: We aim to create a new and more robust image watermarking technique to prevent illegal copying, editing and distribution of media. Method : The watermarking technique proposed in this paper is non-blind and employs Lifting Wavelet Transform on the cover image to decompose the image into four coefficient matrices. Then Discrete Cosine Transform is applied which separates a selected coefficient matrix into different frequencies and later Singular Value Decomposition is applied. Singular Value Decomposition is also applied to the watermarking image and it is added to the singular matrix of the cover image which is then normalized followed by the inverse Singular Value Decomposition, inverse Discrete Cosine Transform and inverse Lifting Wavelet Transform respectively to obtain an embedded image. Normalization is proposed as an alternative to the traditional scaling factor. Results: Our technique is tested against attacks like rotation, resizing, cropping, noise addition and filtering. The performance comparison is evaluated based on Peak Signal to Noise Ratio, Structural Similarity Index Measure, and Normalized Cross-Correlation. Conclusion: The experimental results prove that the proposed method performs better than other state-of-the-art techniques and can be used to protect multimedia ownership.

BINARY IMAGE WATERMARKING THROUGH BLURRING AND BIASED BINARIZATION

2005 ◽  
Vol 05 (01) ◽  
pp. 67-87 ◽  
Author(s):  
HAIPING LU ◽  
YUN Q. SHI ◽  
ALEX C. KOT ◽  
LIHUI CHEN
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Watermarking ◽  
Image Watermarking ◽  
Binary Image ◽  
Experimental Results ◽  
Cosine Transform ◽  
Binary Images ◽  
Blurred Image ◽  
Binarization Threshold

Digital watermarking has been proposed for the protection of digital medias. This paper presents two watermarking algorithms for binary images. Both algorithms involve a blurring preprocessing and a biased binarization. After the blurring, the first algorithm embeds a watermark by modifying the DC components of the Discrete Cosine Transform (DCT), followed by a biased binarization, and the second one embeds a watermark by directly biasing the binarization threshold of the blurred image, controlled by a loop. Experimental results show the imperceptibility and robustness aspects of both algorithms.

Sign in / Sign up

Export Citation Format

Share Document