基于MPUI模型的JPEG2000图像最大隐写容量
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(61170271,61272310,61203288);浙江省自然科学基金(LY12F02031);上海市教育委员会科研创新项目(11YZ284);浙江工业大学校级重点自然科学基金(2012XZ009)


JPEG2000 Image Maximum Steganography Payload Based on MPUI Model
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    隐写容量是信息隐藏的4项性能指标之一,目前,相关科研工作者对其他3项指标,即鲁棒性、透明性和计算复杂性进行过大量的研究,但隐写容量方面的研究却很少.该研究有力地完善了信息隐藏的理论体系,根据JPEG2000压缩标准以及人眼对小波系数改变的敏感程度,借助小波系数的失真代价函数,区分出小波系数的承载秘密信息能力:失真代价函数值越小,该小波系数承载能力就越强;反之,该小波系数承载能力就越弱.当失真代价函数值大于1时,该系数不具有承载信息的能力,即为湿系数.通过最大隐写容量估算实验以及位满嵌入、过位嵌入和湿嵌入等评估实验,验证了所提方法的有效性.

    Abstract:

    Steganography payload is one of the four key performance indicators for information hiding. Previous research on information hiding has mainly focused on the other three performance indicators, namely, the robustness, transparency and computational complexity, with very few work being carried out regarding to the steganography payload. This research aims to effectively improve the theoretical system of information hiding. According to the JPEG2000 compression standard and the human eye sensitivity of changing wavelet coefficients, along with the aid of distortion cost function, the study discriminates the wavelet coefficients' carrying capacity of secret information: The smaller the distortion cost function value, the stronger the wavelet coefficients' carrying capacity. Conversely, the larger distortion cost function value, the weaker the wavelet coefficients' carrying capacity. When the distortion cost function value is greater than one, the coefficient will not have enough capacity to carry information, i.e., wet coefficients. By means of the maximum steganography payload experiments along with the bit full embedding, over bits embedding and wet embedding experiments, the effectiveness of the proposed estimation method in this work is verified.

    参考文献
    相似文献
    引证文献
引用本文

毛家发,钮心忻,杨义先,张娜娜,盛伟国.基于MPUI模型的JPEG2000图像最大隐写容量.软件学报,2014,25(7):1606-1620

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2012-03-17
  • 最后修改日期:2013-08-21
  • 录用日期:
  • 在线发布日期: 2014-07-08
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号