A Novel Digital Watermarking Algorithm using Random Matrix Image

Abstract

The availability of bandwidth for internet access is sufficient enough to communicate digital assets. These digital assets are subjected to various types of threats.[19] As a result of this, protection mechanism required for the protection of digital assets is of priority in research. The threat of current focus is unauthorized copying of digital assets which give boost to piracy. This under the copyright act is illegal and a robust mechanism is required to curb this kind of unauthorized copy. To safeguard the copyright digital assets, a robust digital watermarking technique is needed. The existing digital watermarking techniques protect digital assets by embedding a digital watermark into a host digital image. This embedding does induce slight distortion in the host image but the distortion is usually too small to be noticed. At the same time the embedded watermark must be robust enough to with stand deliberate attacks. There are various techniques of digital watermarking but researchers are making constant efforts to increase the robustness of the watermark image. The layered approach of watermarking based on Huffman coding [5] can soon increase the robustness of digital watermark. [11] Ultimately, increasing the security of copyright of protection. The proposed work is in similar direction where in RMI (Random Matrix Image) is used in place of Huffman coding. This innovative algorithm has considerably increased the robustness in digital watermark while also enhancing security of production.

Watermarking Citra Digital Dengan Information Dispersal Algorithm (Ida) Dan Algoritma Huffman

“…Huffman dapat berguna untuk watermarking citra digital sehingga dapat digunakan untuk menunjukkan keaslian kepemilikan citra digital tersebut. Dengan menggunakan persamaan di atas, maka akan diperoleh: 3) Dari perhitungan di atas, maka parameter F disebarkan ke dalam 16 pasangan (α i ,β i ), yaitu: (0,1), (1,6), (2,9), (3,10), (4,9), (5,11), (6,15), (7,7), (8,11), (9,14), (10,6), (11,2), (12,15), (13,0), (14,10), (15,6…”

On the Analysis of Global and Local Robust Image Watermarking Using Zernike Moments

“…Gupta, 2012 propose a cryptography based blind image watermarking technique that embeds more number of watermark bits in the gray scale cover image without affecting the imperceptibility and increase the security of watermarks. In Pandya, Joshi and Jani, (2013), a layered approach of watermarking based on RMI (Random Matrix Image) is proposed. Nikolaidis, (2012) propose a novel method for region based image watermarking that embeds watermark by first performing the inverse DCT of the original watermark and then inversely normalizing watermark which is then embedded in the original image.…”