A Watermarking Scheme Based on SVM and Tolerable Position Map

[[abstract]]This paper presents a novel digital watermarking technique based on support vector machines (SVMs) and tolerable position map (TPM). The purpose of SVMs is two folds in this study. One is using SVM to identify tolerable positions for watermark embedding on the host image, and the other is using SVM to embed and extract watermarks. By simulating common image attacks on the host image, pixels which are invincible or vulnerable are identified and used for positive or negative samples for training an SVM. Apply this SVM can create a TPM for the host image. To embed and extract watermarks, we use a known binary sequence to train an SVM such that this SVM can be applied for embedding and extracting the watermark. In the proposed scheme, to improve robustness of attacks and image imperceptibility, the watermark is embedded according to the TPM and by asymmetrically tuning blue channels of the central and neighbor pixels. To further reducing extraction errors, the embedded watermark bits are re-modified if necessary according to classifying result of the trained SVM. Our scheme uses only 128 bits in training both SVMs, thus it is time efficient. Experiments show that the proposed scheme provides high PSNR of a watermarked image, low extraction error rate, and extremely robust to common image attacks.[[conferencedate]]20061008~20061011[[booktype]]紙本[[booktype]]電子版[[conferencelocation]]Taipei, Taiwa

The framework of P systems applied to solve optimal watermarking problem

Membrane computing (known as P systems) is a novel class of distributed parallel computing models inspired by the structure and functioning of living cells and organs, and its application to the real-world problems has become a hot topic in recent years. This paper discusses an interesting open problem in digital watermarking domain, optimal watermarking problem, and proposes a new optimal image watermarking method under the framework of P systems. A special membrane structure is designed and its cells as parallel computing units are used to find the optimal watermarking parameters for image blocks. Some cells use the position-velocity model to evolve watermarking parameters of image blocks, while another cell evaluates the objects in the system. In addition to the evolution rules, communication rules are used to exchange and share information between the cells. Simulation experiments on large image set compare the proposed framework with other existing watermarking methods and demonstrate its superiority.National Natural Science Foundation of China No 61170030Chunhui Project Foundation of the Education Department of China No. Z2012025Chunhui Project Foundation of the Education Department of China No. Z2012031Sichuan Key Technology Research and Development Program No. 2013GZX015

Digital Watermarking of Images towards Content Protection.

With the rapid growth of the internet and digital media techniques over the last decade, multimedia data such as images, video and audio can easily be copied, altered and distributed over the internet without any loss in quality. Therefore, protection of ownership of multimedia data has become a very significant and challenging issue. Three novel image watermarking algorithms have been designed and implemented for copyright protection. The first proposed algorithm is based on embedding multiple watermarks in the blue channel of colour images to achieve more robustness against attacks. The second proposed algorithm aims to achieve better trade-offs between imperceptibility and robustness requirements of a digital watermarking system. It embeds a watermark in adaptive manner via classification of DCT blocks with three levels: smooth, edges and texture, implemented in the DCT domain by analyzing the values of AC coefficients. The third algorithm aims to achieve robustness against geometric attacks, which can desynchronize the location of the watermark and hence cause incorrect watermark detection. It uses geometrically invariant feature points and image normalization to overcome the problem of synchronization errors caused by geometric attacks. Experimental results show that the proposed algorithms are robust and outperform related techniques found in literature