The Research On Algorithm For Image Watermark Oriented To Relational Database

Watermarking technique used as a method of information hiding has been ripely developed and widely used, which basical idea is a process of embedding privacy information into various multimedia data, such as images, text, audio or video etc, to offer copyright protection.As the network fleetly developed, more and more attention is focusing on the safety of database. Embedding ownership's information as watermarking into relational database for its copyright protection has been a new heated research on database security. However, multimedia oriented watermarking technique can't be used on database directly for special structure of database. This paper does research on how to improve the robustness of watermarking algorithm oriented to relational database. The contributions of this paper are as follows:1. A new way to embed watermark into database based on (t,n) threshold is brought up. In order to resist various malignant attacks to watermark itself, (t,n) threshold is used to divide watermark into some shares, which are the real ones used to embed into database. While extracting the image watermark, it can be obtained from combination of these shares, so damaging on watermark itself is reduced greatly. 2. Fast independent component analysis , which is based on negentropy is introduced, meanwhile, improved the mode on end-point judgement in the existence FastICA algorithm, which enhance the astnngency of FastICA algorithm to a certain extent.3. A new relational database watermarking algorithm based on independent component analysis is presented ,which uses labeling algorithm and vector iteration to embed image watermarking into relational database. According to the statistic independent weights, it uses FastICA algorithm to pick up watermarking and original data.