一种改进的位平面复杂度分割算法  

Improved Bit-Plane Complexity Segmentation Algorithm

作　　者：娄振华[1] 汤光明[1] 

机构地区：[1]解放军信息工程大学电子技术学院,郑州450004

出　　处：《计算机工程》2008年第19期179-181,205,共4页Computer Engineering

摘　　要：对复杂度直方图的不连续性测度的隐写分析能有效地察觉以位平面复杂度分割(BPCS)隐写的秘密信息的存在。为提高隐写算法的安全性,提出一种改进的BPCS算法,即利用部分可嵌入块作为嵌入信息的调节块,消除由于嵌入秘密信息而造成的复杂度直方图的剧烈变化,确保不连续性测度不会出现明显的峰值。实验结果表明,该算法能有效地抵抗基于复杂度直方图的统计分析,同时也保持了原算法嵌入容量大的特点。Statistical analysis based on complexity histogram discontinuities measure is a powerful steganalytic technique for detecting the presence of secret message embedded in the digital images using Bit-Plane Complexity Segmentation（BPCS）. Therefore, to improve steganographic security, this paper proposes an improved BPCS algorithm that can effectively resist statistical analysis. Part of blocks are used that can embed hiding information as complexity adjustable blocks to remove two clearly discontinuities which are caused by customary BPCS algorithm, and make sure the discontinuities measure disappear obviously peak value. Experimental results show that the improved algorithm can effectively resist statistical analysis based on the complexity histogram, and can maintain the big capacity characteristic of the originally algorithm.

关 键 词：位平面复杂度分割 隐写 复杂度直方图 安全性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]