A multimedia application for watermarking digital images based on a content based image retrieval technique

The current work is focused on the implementation of a robust multimedia application for watermarking digital images, which is based on an innovative spread spectrum analysis algorithm for watermark embedding and on a content-based image retrieval technique for watermark detection. The existing highly robust watermark algorithms are applying “detectable watermarks” for which a detection mechanism checks if the watermark exists or not (a Boolean decision) based on a watermarking key. The problem is that the detection of a watermark in a digital image library containing thousands of images means that the watermark detection algorithm is necessary to apply all the keys to the digital images. This application is non-efficient for very large image databases. On the other hand “readable” watermarks may prove weaker but easier to detect as only the detection mechanism is required. The proposed watermarking algorithm combine’s the advantages of both “detectable” and “readable” watermarks. The result is a fast and robust multimedia application which has the ability to cast readable multibit watermarks into digital images. The watermarking application is capable of hiding 2¹⁴ different keys into digital images and casting multiple zero-bit watermarks onto the same coefficient area while maintaining a sufficient level of robustness.     

一种保护Java3D应用的软件水印算法

针对Java3D应用程序固有的场景图数据结构,提出一种新的用于保护Java3D应用程序的动态数据结构软件水印算法。该算法将一个对场景图节点遍历的初始顺序作为嵌入密钥,利用循环左移及基于阶乘的进制数制方法将水印嵌入软件。阐述水印的嵌入及提取算法步骤。该算法具有不增加场景图节点个数和不影响程序性能的优势,比其他水印算法更加健壮。     

图像隐形水印综述

作为数字媒体版权保护的重要手段,数字水印技术近年来引起了人们极大的兴趣与 关注.本文论述并讨论了如下问题:1)图象隐形水印的基本要求;2)图象隐形水印的原理和研 究方法;3)图象隐形水印技术的研究现状,包括水印基本理论和算法、数据隐藏理论与方法、 水印作为所有权证明的有效性、水印技术的应用动向;4)水印技术的应用前景;5)图象隐形水 印目前存在的问题和未来研究的重点.     

基于整数提升小波的彩色图像盲水印算法

针对以彩色图像为载体的水印的盲提取,提出一种基于整数提升小波变换的盲数字水印算法,把经过置乱处理后的水印利用子带替换法嵌入到整数提升小波域的中频系数上。该算法水印的提取不需要原始图像和标准水印,实现了水印的盲提取,生成的水印不可见性较好,并且对JPEG压缩攻击、中值滤波、SS攻击等具有较好的鲁棒性。     

A semi-blind digital watermarking scheme based on singular value decomposition

This paper presents a robust watermarking approach for hiding grayscale watermarks into digital images. Plugging the codebook concept into the singular value decomposition (SVD), the proposed method embeds the singular values (SVs) of the original image into the watermark one to attain the lossless objective. The experimental results show that the proposed scheme guarantees the extracted watermark on an average and the worst PSNR values of 24.91 and 19.96 dB, respectively. In addition to the guarantee of the quality of extracted watermark image, the security of the referenced watermark is further strengthened by applying chaos permutation on it in advance. The proposed scheme leads to satisfactory robustness to various attacks and is compared to other well-known grayscale watermarking methods to reveal its efficiency for practical applications.     

A robust watermarking scheme for 3D triangular mesh models

Copyright protection of digital media has become an important issue in the creation and distribution of digital content. As a solution to this problem, digital watermarking techniques have been developed for embedding specific information identifying the owner in the host data imperceptibly. Most watermarking methods developed to date mainly focused on digital media such as images, video, audio, and text. Relatively few watermarking methods have been presented for 3D graphical models. In this paper we propose a robust 3D graphical model watermarking scheme for triangle meshes. Our approach embeds watermark information by perturbing the distance between the vertices of the model to the center of the model. More importantly, to make our watermarking scheme robust against various forms of attack while preserving the visual quality of the models our approach distributes information corresponds to a bit of the watermark over the entire model, and the strength of the embedded watermark signal is adaptive with respect to the local geometry of the model. We also introduce a weighting scheme in the watermark extraction process that makes watermark detection more robust against attacks. Experiments show that this watermarking scheme is able to withstand common attacks on 3D models such as mesh simplification, addition of noise, model cropping as well as a combination of these attacks.     

基于Shamir秘密共享方案的数字水印算法

数字水印已成为数字作品版权保护的一种手段,而鲁棒性和不可察觉性是其基本要求.为此,提出了一种基于Shamir秘密共享方案的数字水印算法.该算法首先将图象分成n块,并将水印信息也分成n份,然后通过DCT的相邻系数比较法,将每份水印信息嵌入到图象的相应块中,提取时,只要获得其中的任意t(≤n)份水印信息就可以恢复出原始水印.为提高提取水印图象的精度,给出了基于模糊集的改进算法.实验结果表明,该算法的隐藏效果很好,并且对单一攻击及多种复合攻击具有很好的鲁棒性.     

三维模型数字水印技术研究进展

数字水印技术为网络环境下的三维模型提供版权保护。介绍三维模型数字 水印的特征、分类及其攻击技术,重点分析三维点云模型、三维网格模型、参数曲面模型、 体数据模型数字水印技术以及三维模型数字水印算法性能评价的研究现状,归纳、总结出三 维模型数字水印技术的研究难点以及需要深入研究的问题。     

Protecting digital image copyrights: a framework

Digital watermarks offer a way to counter copyright piracy on the global network. We summarize the fundamental concepts of watermarking and describe a general framework for a copyright protection system. Watermarks efficiently protect copyright when basic demands can be satisfied. However, the demand for watermarks to remain robust under digital image-processing operations has not yet been fully satisfied. Robustness to geometrical distortions is an essential remaining problem for schemes that do not use the original images in the detection procedure. Furthermore, new watermarking schemes must take into account optimizations of current processing algorithms and the development of new algorithms. Better future compression techniques, for example, must not destroy watermarks embedded at any earlier time     

A robust software watermarking for copyright protection

This paper advocates protecting software copyright through hiding watermarks in various data structures used by the code, e.g., B+-trees, R-trees, linked lists, etc. Prior proposals hide the watermarks in dummy data structures, e.g., linked lists and graphs that are created, solely for this reason, during the execution of the hosting software. This makes them vulnerable to subtractive attacks, because the attacker can remove the dummy data structures without altering the functionality or the semantic of the software program. We argue that hiding watermarks in one or more data structures that are used by the program would make the watermark more robust because disturbing the watermark would affect the semantic and the functionality of the underlying software. The challenge is that the insertion of the watermark should have a minimal effect on the operations and performance of the data structure.This paper proposes a novel method for watermarking R-tree data structure and its variants. The proposed watermarking technique does not change the values of the stored data objects. It takes advantage of the redundancy in the order of entries inside the R-tree nodes. Entries are arranged relative to a “secret” initial order, known only to the software owner, using a technique based on a numbering system that uses variable radix with factorial base. The addition of the watermark in the R-tree data structure does not affect the performance nor does it increase the size of the R-tree. The paper provides a detailed security analysis and performance evaluation to show that the embedded watermarks are robust and can withstand various types of attacks.