We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/A New Robust and Blind Image Watermarking Scheme In Frequency Domain Based On Optimal Blocks Selection
PeriodicalsComputer Science & Information Technology

A New Robust and Blind Image Watermarking Scheme In Frequency Domain Based On Optimal Blocks Selection

Checking your access to this record.

Abstract & Overview

Image, audio and video are the first media affected by hacking due to the availability of the internet and to the high speed connection.One of the solutions to solve such problems is watermarking.Digital watermarking is the process of embedding an imperceptible and a robust signature into a digital signal.In this paper, we focus on image watermarking.We have embedded the watermark in the frequency domain using Discrete Cosine Transform.The choice of the blocks where we insert the watermark bits depends on a preprocessing study on the original and compressed-decompressed image.Then we have implemented a blind detection algorithm.We tried to enhance the security of our technique by applying an Arnold transform to the embedded watermark.Finally, we have tested the robustness of our method by applying many attacks to the watermarked images using Stirmark 3.1.The results demonstrate that our method yields a high level of imperceptibility and robustness against JPEG compression, unique and double Stirmark attacks.

Cite this record

Nesrine Tarhouni, Maha Charfeddine, Chokri Ben Amar (2018). A New Robust and Blind Image Watermarking Scheme In Frequency Domain Based On Optimal Blocks Selection. Computer Science Research Notes. https://doi.org/10.24132/csrn.2018.2802.11

Copy in another style

Tarhouni, N., Charfeddine, M., & Amar, C. B. (2018). A New Robust and Blind Image Watermarking Scheme In Frequency Domain Based On Optimal Blocks Selection. Computer Science Research Notes. https://doi.org/10.24132/csrn.2018.2802.11
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.