A blind image watermarking algorithm based on amalgamation domain method
by Qingtang Su
International Journal of Computational Science and Engineering (IJCSE), Vol. 19, No. 2, 2019

Abstract: Combining with the spatial domain and the frequency domain, a novel blind digital image watermarking algorithm is proposed to resolve the protecting copyright problem in this paper. When embedding watermark, the generation principle and distribution features of direct current (DC) coefficient are utilised to directly modify the pixel values in the spatial domain, then four different sub-watermarks are embedded into different areas of the host image for four times, respectively. When extracting watermark, the sub-watermark is extracted with blind manner according to DC coefficients of watermarked image and the key-based quantisation step, and then the statistical rule and "first to select, second to combine" are proposed to form the final watermark. Hence, the proposed algorithm not only has the simple and quick performance of the spatial domain but also has the high robustness feature of DCT domain. Many experimental results have proved that the proposed watermarking algorithm has good invisibility of watermark and strong robustness for many added attacks, e.g., JPEG compression, cropping, adding noise, etc. Comparison results also have shown the benefits of the proposed algorithm.

Online publication date: Thu, 20-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com