Robust distance-based watermarking for digital image
2008 (English)In: Proceedings of the 2008 International Conference on Security and Management, SAM 2008, 2008, p. 404-409Conference paper, Published paper (Refereed)
Abstract [en]
In this paper, an algorithm is developed to invisibly watermark a cover object (color image) using watermark object (iconic image). The algorithm is based on the distances among the addresses of values of the cover object. These distances use to make the embedding. The order of manipulating these distances are specified by the values of the watermark data which is dealt with serially. The algorithm serves and achieves self encryption key. Each watermark object has its unique pattern of distances at different possible lengths of distance bits. This enhances the complexity of sequential embedding. The algorithm is tested using direct and single level and double level of Two-Dimensional Discrete Wavelet Transform (2D DWT) embeddings. Two important issues are addressed. Firstly is to achieve a high Peak Signal to Noise Ratio (PSNR). The ratio was found to increase with an increasing of distance bits. Secondly is that the watermarked object retains the same properties of cover object. The algorithm shows resisting and withstanding against the most important attacks. Some of these include the lossy compression, blurring, resize and some types of Noise.
Place, publisher, year, edition, pages
2008. p. 404-409
Keywords [en]
2D DWT and attacks, Cover object, Distance bits, Watermark object, Watermarked object, Algorithms, Cryptography, Digital watermarking, Discrete wavelet transforms, Signal to noise ratio, Watermarking
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-21142Scopus ID: 2-s2.0-62749089378ISBN: 160132085X (print)ISBN: 9781601320858 (print)OAI: oai:DiVA.org:mdh-21142DiVA, id: diva2:663038
Conference
2008 International Conference on Security and Management, SAM 2008, 14 July 2008 through 17 July 2008, Las Vegas, NV
Note
Sponsors: Harvard University; University of California; University of Minnesota; University of Illinois at Urbana-Champaign; Georgia Institute of Technology and Emory University
2013-11-082013-08-272025-10-10Bibliographically approved