计算机工程2012，Vol.38Issue(21)：161-163,167,4.DOI:10.3969/j.issn.1000-3428.2012.21.043
基于免疫匹配追踪的语音稀疏分解算法
Speech Sparse Decomposition Algorithm Based on Immune Matching Pursuit
摘要
Abstract
Aiming at the problem that since the standard Matching Pursuit(MP) algorithm tends to cause enormous calculation quantity when searching for the optimal atoms, this paper proposes a scheme of Matching Pursuit algorithm based on Immune Algorithm(IA-MP). This algorithm adopts immune cloning optimization mechanism to search for the optimal atoms, using the population scale of antibodies to control the size of redundant dictionary, and choosing real cross and nonsymmetrical mutation to ensure the completeness of dictionary. Simulation results show that, compared with the standard MP and Genetic Algorithm-Matching Pursuit(GA-MP) algorithms, IA-MP algorithms can obviously reduce the matching pursuit calculation quantity, and the performance of this algorithm is more stable, in addition, this algorithm has high signal reconstruction accuracy.关键词
匹配追踪/免疫算法/稀疏分解/冗余字典/重构信号/语音信号Key words
Matching Pursuit(MP)/ Immune Algorithm(IA)/ sparse decomposition/ redundant dictionary/ reconstructing signal/ speech signal分类
信息技术与安全科学引用本文复制引用
周燕,刘韬,尚丽..基于免疫匹配追踪的语音稀疏分解算法[J].计算机工程,2012,38(21):161-163,167,4.基金项目
国家自然科学基金资助项目(60970058) （60970058）
江苏省青蓝工程基金资助项目 （）
福建省自然科学基金资助项目(2010J01263) （2010J01263）
苏州市职业大学创新团队基金资助项目(3100125) （3100125）
苏州市职业大学创新基金资助项目(2011SZDCC06) （2011SZDCC06）
