A robust zero-watermarking scheme using Canny edge detector
by Mahsa Shakeri; Mansour Jamzad
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 5, No. 1, 2013

Abstract: By expansion of digital multimedia and networking technology, the problem of ownership protection has become increasingly important. Digital watermarking is an efficient way for copyright protection of digital images. Traditional watermarking techniques degrade the quality of host image by embedding a watermark logo. Facing this problem, a new watermarking approach called zero-watermarking has been proposed. In zero-watermarking methods, the watermark does not require to be embedded into the protected image but it uses both the watermark and the protected image to generate a verification map which is registered to a trusted authority for further protection. In this paper we propose a robust zero-watermarking method which uses Canny edge detection and morphological dilation. Experimental results demonstrate that our proposed scheme is robust against common geometric and non-geometric attacks including blurring, JPEG compression, noise addition, sharpening, scaling, rotation, and cropping. In addition, our experimental results show that our method could outperform the most recent related methods in most cases.

Online publication date: Sat, 26-Jul-2014

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 Electronic Security and Digital Forensics (IJESDF):
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