Personal tools
You are here: Home → Knowledge Base → A New Robust Watermarking Scheme for Color Image in Spatial Domain  

A New Robust Watermarking Scheme for Color Image in Spatial Domain

Main information
This paper presents a new robust watermarking scheme for color image based on a block probability in spatial domain. A binary watermark image is permutated using sequence numbers generated by a secret key and Gray code, and then embedded four times in different positions by a secret key. Each bit of the binary encoded watermark is embedded by modifying the intensities of a non-overlapping block of 8*8 of the blue component of the host image. The extraction of the watermark is by comparing the intensities of a block of 8*8 of the watermarked and the original images and calculating the probability of detecting '0' or '1'. Tested by benchmark Stirmark 4.0, the experimental results show that the proposed scheme is robust and secure against a wide range of image processing operations. 
No referenced Knowhow defined
WP5: Detection, Extraction and Annotation of Knowledge. 
School of Informatics University of Bradford  Jianmin Jiang, Ying Weng 
2007-11-05 18:41  Request for more detail


Access and Use Rights
For educational purposes only - if public document.  For educational purposes only - if public document. 


Protection Status
Copyright School of Informatics, University of Bradford.  Patent Pending. 
Licensing Pending.  Utility Model Pending. 
 
Accepted by IEEE THE THIRD INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY & INTERNET–BASED SYSTEMS (SITIS' 2007 )  
Open, everybody can see the attachment 


Download Section


a-new-robust-watermarking-scheme-for-color-image-in-spatial-domain.pdf
 
LIVE's knowledge base
  • What is available here?

Here you can search and access the documented work of the LIVE project. Documents include the official reporting of the project's work known as "deliverables", scientific and technical publications, study reports, press material, presentation material  as well as IPR pending material.

  • How can I access the material?

You can search this knowledge base by project partner, work area or key words.

By simply clicking "all" the complete list of documents will be listed.

  • Is everything open to the public?

Please note that only those publications marked in green have been cleared for immediate public access. To request access to those publications not open please click on the "request for more detail" link in the relevant document. Your request will be automatically sent to the authors for consideration.