返回
Adaptive joint sparse recovery algorithm based on Tabu Search
DOI:10.1016/j.neucom.2016.10.056.png)
摘要
En 中文
This paper introduces a novel metaheuristic methodology to address the Multiple Measurement Vectors problem using a well-known greedy search strategy. A modified version of Tabu Search algorithm is utilized to determine a precise estimation of row support and then joint sparse samples are reconstructed using MMSE criterion. The proposed approach is more robust to the sparsity order variations and noise uncertainty, in comparison with the conventional MMV problem solvers. Furthermore, to avoid wastage of the sampling resources and reduce the implementation costs, a two-step joint sparse recovery framework is developed which the first step predicts and adjusts the optimum sampling rate and the second one reconstructs signal vectors applying obtained sampling rate. Numerical simulations demonstrate the superiority of proposed technique for both improving the performance and reducing the computational complexity and sampling costs.
Keyword:
Adaptive two-step framework
Joint sparse recovery
Minimum number of samples
Multiple Measurement Vectors
Row support recovery
Tabu Search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II),Pb(II) 和Cd(II) 离子的吸附

