期刊文献+

帐篷混沌序列稀疏测量矩阵构造 被引量:3

Construction of sparse measurement matrix via tent chaotic sequence
下载PDF
导出
摘要 测量矩阵的构造是压缩感知(CS)中重要的研究内容之一。利用混沌系统伪随机性、遍历性的特点,提出了一种基于帐篷混沌序列构造确定性稀疏随机矩阵的方法。对混沌系统生成的确定性序列进行了间隔采样,采样后的序列满足统计独立性,然后通过符号函数映射,生成了具有稀疏性质的伪随机序列,进而构造出混沌稀疏测量矩阵。仿真实验表明:该方法构造出的混沌稀疏测量矩阵与高斯随机矩阵、稀疏随机矩阵及Bernoulli随机矩阵相比,具有类似的重构性能。混沌系统参数与初值固定时,构造的混沌稀疏测量矩阵是确定的,计算复杂度小且硬件上容易实现。 Construction of measurement matrix is one of the important research content in compressed sensing (CS). Using characteristic of pseudo randomness, ergodicity of chaotic systems,propose a method for construction of the sparse measurement matrix based on tent chaotic sequence. The method for deterministic chaotic sequence generated by the system will be interval sampling, so that the sampled sequence meet statistical independence, by symbol function mapping generate pseudo-random sequence having sparsity, thereby construct measurement matrix of chaotic sparse. Simulation experiments results show that compared with Gaussian random matrices, sparse random matrix and Bernoulli random matrix, this proposed matrix has a similar reconstruction performance. The proposed measurement matrix is deterministic when parameter of chaotic system and initial value are fixed, its computation complexity is small and it is easy to be realized by hardware.
出处 《传感器与微系统》 CSCD 2017年第7期50-52,56,共4页 Transducer and Microsystem Technologies
基金 国家自然科学基金青年科学基金资助项目(11401284) 教育部高校博士学科科研基金联合资助项目(20132121110009) 辽宁省教育厅基金资助项目(L2015108)
关键词 压缩感知 混沌系统 测量矩阵 稀疏矩阵 compressed sensing(CS) chaotic system measurement matrix sparse matrix
  • 相关文献

参考文献8

二级参考文献85

  • 1单梁,强浩,李军,王执铨.基于Tent映射的混沌优化算法[J].控制与决策,2005,20(2):179-182. 被引量:194
  • 2Donoho D L. Compressed sensing[J]. [EEE Transactions on Information Theory, 2006, 52(4): 1289-1306.
  • 3Candes E J and Tao T. Decoding by linear programming[J]. IEEE Transactions on Information Theory, 2005, 51(12): 4203-4215.
  • 4Candes E J, Romberg J, and Tao T. Robust uncertainty principles: exact signM reconstruction from highly incomplete frequency information[J]. IEEE Transactions on Information Theory, 2006, 52(2): 489-509.
  • 5Candes E J, Eldar Y C, Needell D, et al.. Compressed sensing with coherent and redundant dictionaries[J]. Applied and Computational Harmonic Analysis, 2011, 31(1): 59-73.
  • 6Zhang T. Sparse recovery with orthogonal matching pursuit under RIP[J]. IEEE Transactions on Information Theory, 2011, 57(9): 6215-6221.
  • 7Haupt J, Bajwa W, Raz G, et al.. Toepitz compressed sensing matrices with applications to sparse channel estimation[J]. IEEE Transactions Information Theory, 2010, 56(11):5862-5875.
  • 8Luo J, Liu X, and Rosenberg C. Does compressed sensing improve the throughput of wireless sensor networks?[C]. IEEE International Conference on Communications, Cape Town. 2010: 1-6.
  • 9Lee S, Pattem S, Sathiamoorthy M, et al.. Spatially-localized compressed sensing and routing in multi~hop sensor networks[C]. Proceedings of the Third International Conference on Geosensor Networks, Oxford, 2009: 11-20.
  • 10Wang Wei, Garofalakis M, and Ramchandran K. Distributed sparse random projections for refinable approximation[C]. IEEE International Symposium on Information Processing in Sensor Networks, Cambridge, 2007: 331-339.

共引文献98

同被引文献17

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部