arrow
返回

Adaptive joint sparse recovery algorithm based on Tabu Search

delete2017-02-01
delete4
PRE
AI
M
Mohsen Ghadyani
A
Ali Shahzadi *
DOI:10.1016/j.neucom.2016.10.056delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

S
semnan university
学者数:
3.4K
论文数: 3.2K
被引数: 2
引用论文

引用论文

Sequential Compressed Sensing
err2010-04-01
err112
errOAAI
errMalioutov, Dmitry M.; Sanghavi, Sujay R.; Willsky, Alan S.
err分享
err收藏
Efficient dye removal and separation based on graphene oxide nanomaterials
err2020-01-01
err0
PREAI
errBrennan Mao; Boopathi Sidhureddy; Antony Raj Thiruppathi; Peter C. Wood; Aicheng Chen
err分享
err收藏
Reactor internals design反应堆内部构件设计
err2004-10-01
err0
PREAI
errJunya Sumita; Masahiro Ishihara; Shigeaki Nakagawa; Takayuki Kikuchi; Tatsuo Iyoku
err分享
err收藏
学者 查看更多内容