A blind watermarking algorithm based on modular arithmetic in the frequency domain

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robustness is the important issue in watermarking, robustness at the same time with blind watermark recovering algorithm remains especially challenging. This paper presents a combined DWT and DCT still image blind watermarking algorithm. The two-level DWT are performed on the original image, the low-frequency sub-band is divided into blocks, the DCT is performed on the every block, the DCT coefficients of every block are sorted using Zig-Zag order, the DCT lowfrequency coefficient is selected as embedding watermarking. The watermarking signals are embedded into the selected embedding points using the modular arithmetic. The watermark recovering is the inverse process of the watermark embedding, according to the answer of the modular arithmetic, we can estimate the value of embedded the watermark. The algorithm is compared with a pure DWT-based scheme Experiment results shown that the proposed algorithm is robust to many attacks such as JPEG compression, addition noise, cropping, JPEG compression, median filter, rotation, and resize etc. Proposed algorithm is shown to provide good results in term of image imperceptibility, too. © 2007 Springer.

Cite

CITATION STYLE

APA

Jin, C., Zhang, Z., Jiang, Y., Qu, Z., & Ma, C. (2007). A blind watermarking algorithm based on modular arithmetic in the frequency domain. In Advances and Innovations in Systems, Computing Sciences and Software Engineering (pp. 543–547). https://doi.org/10.1007/978-1-4020-6264-3_94

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free