节点文献

利用混沌优化实现基于MP的信号稀疏分解

MP Based Sparse Decomposition of Signals by Chaos Optimization

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 方辉周黎霞尹忠科王建英

【Author】 FANG Hui1,ZHOU Li-xia2,YIN Zhong-ke1,WANG Jian-ying1(1.School of Information Science & Technology,Southwest Jiaotong University,Chengdu 610031,China;2.PETROCHINA Tarim Oil Field,Korla 841000,China)

【机构】 西南交通大学信息科学与技术学院中国石油塔里木油田分公司

【摘要】 信号的稀疏表示在信号处理的许多方面都有重要的应用,但稀疏分解计算量十分巨大,难以被推广而实现产业化。混沌是一种普遍的非线性现象,具有随机性、遍历性和内在规律性的特点,混沌运动能在一定范围内按其自身的规律不重复地遍历所有状态。因此,如果利用混沌变量进行优化搜索,无疑会比随机搜索更具优越性。本文利用变尺度混沌优化方法在优化搜索过程中不断缩小搜索空间,快速寻找匹配追踪(MP)过程中每一步的近似最佳原子,提高信号稀疏分解的速度,算法的有效性为实验结果所证实。

【Abstract】 Sparse representation of signals has many important applications in signal processing,but the computational burden in the signal sparse decomposition process is so huge that it is almost impossible to apply it to industrialization.Chaos is a universal nonlinear phenomenon with the stochastic property,ergodic property and regular property,and the movement of chaos has the ability to ergodic all the statements in the area with its own regularity without repetition.So if we put the chaos variables into practice to achieve chaos optimal search,it is no doubt that this algorithm will be much more superior than random search.In this paper,the mutative scale chaos optimization algorithm is implemented to fast search for the approximately optimal atom at each step of Matching Pursuit(MP),and the speed of signal sparse decomposition is improved a lot.The validity of this algorithm is proved by experimental results.

【基金】 国家自然科学基金项目(60772084);国家科技重大项目资助(2008ZX05046)
  • 【文献出处】 铁道学报 ,Journal of the China Railway Society , 编辑部邮箱 ,2009年05期
  • 【分类号】TN911.7
  • 【被引频次】14
  • 【下载频次】199
节点文献中: