可泛化的基于DCT域的隐写术算法

Generalization algorithm of steganography based on DCT domain

给出了一种新的基于DCT域的可以实现“大容量”、“盲提取”的隐写术算法,该算法能隐藏任意类型的秘密信息,并能较好地支持“Kerckhoffs准则”。此外,经过少许的变动,本算法可以成为一种“模型”,一种能够涵盖空域、变换域大部分替换类算法的“统一模型”。本算法基于图像的DCT域,但其思想可适用于其它变换域。实验结果表明:在满足“不可见”、“盲提取”的前提下,本算法能正确嵌入/提取“大容量”的秘密信息。

Steganography is a important field of information hiding. A new algorithm based on DCT domain is proposed, which has high capacity of data hiding, is blind extracting, is invisible, obey ＂The Rule of Kerckhoffs＂, and can embed all kind of secret information. By changing a little, This alogorithrn can become a model, i.e. A generalization model which can cover most of the ＂alogorithms of substitution＂. This alogorithm is based on DCT domain, but its thinking is applied to other transfer domains. The experimental results demonstrate this algorithm correctly embed and extract high capacity of secret data.