Watermarking Relational Data Based on Adaptive Mechanism
A novel watermarking algorithm is proposed for intellectual property rights (IPR)protection for relational data. An adaptive mechanism is adopted to choose an optimal embedding scheme for each datasheet according to its data characteristics based on predefined several fundamental schemes aiming at making distortion of the watermarked data to be smallest.The error-correcting coding technology and the majority voting principle are employed to improve the robustness of watermarking.Experimental results reveal that the watermarking can meet the invisibility and the blind detection requirements and the proposed algorithm has good resistance to conventional attacks such as subset deleting,adding,updating, and so on.
Relational data Watermarking IPR protection Robustness Adaptive mechanism
Yuer Wang Zhongjie Zhu Feng Liang Gangyi Jiang
Ningbo Key Lab.for DSP Zhejiang Wanli University Ningbo,Zhejiang 315100,China Institute of Circuits and Systems Ningbo University Ningbo,Zhejiang 315211,China
国际会议
2008 IEEE International Conference on Onformation and Automation(IEEE 信息与自动化国际会议)
张家界
英文
131-134
2008-06-20（万方平台首次上网日期，不代表论文的发表时间）