LSB Matching的嵌入效率分析  

Analysis on Embedding-efficiency of LSB Matching

作　　者：李晓龙[1] 杨斌[1] 

机构地区：[1]北京大学计算机科学技术研究所,北京100871

出　　处：《南京理工大学学报》2008年第4期429-433,共5页Journal of Nanjing University of Science and Technology

摘　　要：为了提高LSB matching算法的嵌入效率,提出了使用完全覆盖集的隐写方法。建立了基于完全覆盖集的隐写方法的理论框架,使用将像素点分组的方式对每组像素点来嵌入信息,同时保证了在嵌入过程中每点像素值最多改变1。给出了基于不同参数的完全覆盖集的具体例子以及与之相应的隐写方法的嵌入效率。计算结果表明:由完全覆盖集所给出的隐写方法能够显著提高LSB matching的嵌入效率。To improve the embedding-efficiency of LSB matching, a novel steganographic scheme based on completely covering set （CCS） is proposed. The theoretical framework of the CCS-based steganographic scheme is given, in which pixels are divided into groups and secret data are embedded into each group. The proposed scheme guaranties that the pixel value changes at most one in the embedding process. Examples of CCS with different parameters are given, and the embedding-efficiencies of the corresponding schemes are calculated. It shows that the CCS based steganographic scheme can significantly improve the embedding-efficiency of LSB matching.

关 键 词：隐写 LSB MATCHING 嵌入效率 完全覆盖集 

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