期刊文献+

基于差分进化算法改进SVD图像水印 被引量:5

IMPROVE SVD IMAGE WATERMARKING BASED ON DIFFERENTIAL EVOLUTION ALGORITHM
在线阅读 下载PDF
导出
摘要 水印的透明性与鲁棒性是一对矛盾。在鲁棒性不变的情况下,尽量减少图像的修改量,使含水印图像的透明度得到提高,确保水印算法的安全性。提出基于差分进化算法(DE)来改进SVD水印算法的透明度。通过DE算法获得的最佳值,来弥补图像在SVD嵌入水印后造成的视觉损失。实验表明,在嵌入强度相同的条件下,水印算法的透明度有了进一步的提高。 Watermark transparency and robustness contradicts against each other.On the one hand the robustness ought to be kept unchanged,on the other hand modifications to the image ought to be minimised in order to raise the transparency of the watermarked image,so that the safety of the watermarking algorithm is ensured.The paper proposes an improved differential evolution algorithm to ameliorate the transparency of SVD watermarking algorithm.DE algorithm can figure out an optimal value to remedy the vision losses caused by the SVD embedding watermark.Experiment results indicate that when imposed by the same embedding strengths,the proposed algorithm can enhance the watermarking transparency.
出处 《计算机应用与软件》 CSCD 2011年第7期277-280,共4页 Computer Applications and Software
关键词 水印 奇异值分解 差分进化算法 透明性 Warkmark SVD Differential evolution algorithm Transparency
  • 相关文献

参考文献9

  • 1Chin Chen Chang, Piyu Tsai, Chaa Chen Lin. SVD-based digital image watermarking scheme [ J ]. Pattern Recogn. Letl. 2005,26 ( 10 ) : 1577 - 1586.
  • 2Kuo Liang Chung, Wei Ning Yang, Yong Huai I-Iuang, et al. On SVD- based watermarking algorithm [ J ]. Applied Mathematics and Comutation ,2007,155 :Sd - 57.
  • 3Ming Quan Fan, Hong Xia Wang, Sheng Hun Li. Restudy on SVD-based watermarking Scheme[ J]. Applied Mathematics and Comutation 2009, 203:926 - 930.
  • 4Coloml A, Dorlgo M, Maniezzo V, et al. Distributed optimization byant colonies [ C ]//Proceedings of the 1 st European Conference on Artificial Life, 1991:134 - 142.
  • 5王培崇,钱旭,王月,虎晓红.差分进化计算研究综述[J].计算机工程与应用,2009,45(28):13-16. 被引量:19
  • 6Aslantas V. An optimal robust digital image watermarking based on SVD using differential evolution algorithm[ J]. Optics Communications 2009,282 : 769 - 777.
  • 7常彦鑫,高正红.自适应差分进化算法在气动优化设计中的应用[J].航空学报,2009,30(9):1590-1596. 被引量:7
  • 8邱威,张建华,刘念.微分进化算法在电力系统中的应用[J].现代电力,2009,26(5):11-17. 被引量:16
  • 9吴亮红,王耀南,袁小芳,张剑.多目标优化问题的差分进化算法研究[J].湖南大学学报(自然科学版),2009,36(2):53-57. 被引量:20

二级参考文献58

共引文献58

同被引文献28

  • 1MOH.中国护理事业发展规划纲要(2005—2010年)[J].中国医院,2005,9(9):26-28. 被引量:43
  • 2Punnakitikashem P,Rosenberger J M,Behan D B,et al.An optimization-based prototype for nurse assignment[C]//Proceedings of the 7th Asian Pacific Industrial Engineering and Management Systems Conference,2006:17-20.
  • 3Sundaramoorthi D,Chen V C P,Rosenberger J M,et al.A data-integrated simulation model to evaluate nurse-patient assignments[J].Health Care Management Science,2009,12(3):252-268.
  • 4Punnakitikashem P,Rosenberger J M,Behan D B.Stochastic programming for nurse assignment[J].Computational Optimization and Applications,2008,40(3):321-349.
  • 5Schaus P,Van Hentenryck P,Régin J C.Scalable load balancing in nurse to patient assignment problems[M]//Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.Berlin Heidelberg:Springer,2009:248-262.
  • 6Bilgin B,De Causmaecker P,Rossie B,et al.Local search neighbourhoods for dealing with a novel nurse rostering model[J].Annals of Operations Research,2012,194(1):33-57.
  • 7Burke E K,Li J,Qu R.A hybrid model of integer programming and variable neighbourhood search for highlyconstrained nurse rostering problems[J].European Journal of Operational Research,2010,203(2):484-493.
  • 8Tsai C C,Li S H A.A two-stage modeling with genetic algorithms for the nurse scheduling problem[J].Expert Systems with Applications,2009,36(5):9506-9512.
  • 9Chen Tianshi,Tang Ke,Chen Guoliang,et al.Analysis of computational time of simple estimation of distribution algorithms[J].IEEE Transactions on Evolutionary Computation,2010,14(1):1-22.
  • 10Voloshynovskiy S, Pun T, Fridrich J, Memon N. Security of da- ta hiding technologies [J].Signal Processing, 2003, 83(10) : 2065 -2067.

引证文献5

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部