摘要
该文提出基于最小平方策略以及导出的三次方程的检测最低有效位(LSB)隐藏信息容量的新算法。与Dumitrescu等人(2003)提出的方法比较,新算法具有下列优点:检测的前提条件更宽松、虚警概率更低(由13％降至4％左右),估计的精度提高约9％,而且检测速度更快。该文还给出了具体的检测步骤和相关的理论推导。
This paper presents a fast algorithm to detect the Least Significant Bit (LSB) steganography. The new approach is inspired by the work of Dumitrescu et al.(2003) who detected LSB steganography via sample pair analysis. The new algorithm combines with the statistical measures developed by Dumitrescu and a new least square estimation. A simple cubic equation is deduced to describe the length of hidden messages with relatively high robust and precision. Moreover, compared with Dumitrescu's algorithm, the novel method has much lower false alarm rate of 5% than that of 13.79%, and the estimating precision is about 9% higher if the embedding ratio is less than 10%, and the speed is also about 15 % faster. Some theoretical derivations are also included.
出处
《电子与信息学报》
EI
CSCD
北大核心
2005年第3期392-396,共5页
Journal of Electronics & Information Technology
基金
国家自然科学基金(10171017)国家自然科学基金重大研究计划(90204013)上海市科技发展基金(035115019)教育部全国优秀博士学何论文作者专项基金资助课题
关键词
信息隐藏
LSB
抽样对
最小二乘法
盲估计
Steganography, LSB, Sample pairs, Least square method, Blind estimation
