检索结果-南通市图书馆

Steganography in low bit-rate speech streams based on quantization index modulation controlled by keys

Science China(Technological Sciences) 2017年第10期60卷 1585-1596页

作者： HUANG YongFeng TAO HuaiZhou XIAO Bo chang chinchen Department of Electronic Engineering Tsinghua University Department of Information Engineering and Computer Science Feng Chia University

Since low bit-rate speech codecs used for voice over internet protocol （VolP）, such as iLBC （internet low bit-rate codec）, G.723.1 and G.729A, have less redundancy due to high compression, it is more challenging to embed information in low bit-rate speech streams of VolP. In this study, a new method is proposed for steganography in low bit-rate speech streams of VolP. The core idea of this method is setting up a graph model for the codebook space of the quantizer. Based on the graph model, the method realises a quantization index modulation （QIM）-controlled algorithm for partitioning the codebook space. It can be proved that this method can minimize signal distortion while steganography taking place. Taking into account codeword partition balance and partition diversity, the proposed steganographic algorithm was based on QIM controlled by secret keys, i.e., mapping the ways of codebook division into secret keys, thereby significantly improving the undetectability and robustness of VolP steganography. Performance measurements and steganalysis experiments showed that the proposed QIM-controlled steganographic algorithm was more secure and robust than the QIM algorithm, the conventional RANDOM algorithm and the original codebook algorithm.

关键词： Steganography VoIP QIM graph theory QIM-controlled

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

AN ALGORITHM FOR MINING ASSOCIATION RULES WITH WEIGHTED MINIMUM SUPPORTS

AN ALGORITHM FOR MINING ASSOCIATION RULES WITH WEIGHTED MINI...

引用

IFIP TC12 WG12.5-Second IFIP Conference on Artificial Intelligence Applications and Innovations(AIAI2005)

作者： Yuchiang Li chinchen chang Jiehshan Yeh Department of Computer Science and Information Engineering National Chung Cheng University Department of Information Engineering and Computer Science Feng Chia University Department of Computer Science and Information Management Providence University

Most existing algorithms employ a uniform minimum support for mining association ***,each item in a publication database,even each set of items,is exhibited in an individual period.A reasonable minimum support threshold has to be adjusted according to the exhibition period of each ***,this paper proposes a new algorithm,called WMS,for mining association rules with weighted minimum supports in publication *** discovers all frequent itemsets which satisfy their individual requirement of minimum support *** applies the group closure property to prune futile itemsets,to reduce the number of candidates generated,and thus to generate the candidate sets efficiently.

关键词： data mining association rules multiple minimum support

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：