A Blind Watermarking Algorithm Based on DCT

Zhao, Ran; Lee, Hua; Hua-wei, Pang; Hu, Boning

doi:10.1109/iita.2008.482

Cited by 11 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Huang and Guan [13] used DCT and Singular Value Decomposition (SVD) based watermarking strategy for achieving highest robustness without losing transparency. Zhao et al [14] applied the concept of threshold for watermarking and presented a technique with good imperceptibility and robustness. Naik and Holambe [15] presented blind watermarking technique based on adding entire watermark image by changing DCT coefficients of cover image to add odd or even determined by the DCT coefficients of watermark image.…”

Section: Introductionmentioning

confidence: 99%

Fusion Framework for Robust and Secured Watermarking

Sharma¹,

Goyal²,

Brar³

2014

IJCA

View full text Add to dashboard Cite

This paper presents a robust and secure watermarking technique for digital image. To implement the technique, Discrete Wavelet Transform (DWT) is applied on cover image. Further on Low-Low (LL) sub-band of DWT, Discrete Cosine Transform (DCT) is applied which is followed by Singular Value Decomposition (SVD). To introduce the secure watermarking, watermark is secured using Arnold Transformation and embedded in the cover image. Parameters such as Peak Signal to Noise Ratio (PSNR) and Normalized Correlation (NC) are used for checking the reliability of the proposed technique. Different attacks like noise, filtering, rotation, cropping, flipping, and compression are applied on watermarked image to check the robustness of the proposed approach.

show abstract

Section: Introductionmentioning

confidence: 99%

Fusion Framework for Robust and Secured Watermarking

Sharma¹,

Goyal²,

Brar³

2014

IJCA

View full text Add to dashboard Cite

show abstract

“…Obviously, The position of the used coefficients and the quantization step are crucial to the robustness of watermark. Studies were conducted to find the best position of the coefficients [4] [9]. In fact, the watermark can resist different attacks when watermark data is embedded to different coefficients.…”

Section: Introductionmentioning

confidence: 99%

A Multiple Frequency Band Watermarking Algorithm Based on Stripe Image

Liu

Chen

2014

AMR

View full text Add to dashboard Cite

In this paper, a multiple frequency band watermarking algorithm based on stripe image is proposed. The algorithm converts watermark string representing the copyright of image works to stripe image before embedding it to host image. Because of the error correction ability of the stripe image, the algorithm takes on high robustness. This paper also proposed a multiple frequency band embedding strategy through analyzing and classifying various watermark attacking algorithm. Applying this algorithm, watermark can stand several kinds of attacks such as low pass filter and high pass filter. Experimental results show that a blind watermarking algorithm with high robustness to various watermark attacking can be achieved through combining stripe image coding and multiple frequency band strategy.

show abstract

A Novel and Efficient Blind Image Watermarking In Transform Domain

Sunesh

Kishore

2020

Procedia Computer Science

View full text Add to dashboard Cite

A Blind Watermarking Algorithm Based on DCT

Cited by 11 publications

References 6 publications

Fusion Framework for Robust and Secured Watermarking

Fusion Framework for Robust and Secured Watermarking

A Multiple Frequency Band Watermarking Algorithm Based on Stripe Image

A Novel and Efficient Blind Image Watermarking In Transform Domain

Contact Info

Product

Resources

About