.png){kind=icon}
.png){kind=icon}
Return
A heuristic search algorithm for the multiple measurement vectors problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2014.01.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address the multiple measurement vectors problem, which is now a hot topic in the compressed sensing theory and its various applications. We propose a novel heuristic search algorithm called HSAMMV to solve the problem, which is modeled as a combinatorial optimization. HSAMMV is proposed in the framework of simulated annealing algorithm. The main innovation is to take advantage of some greedy pursuit algorithms for designing the initial solution and the generating mechanism of HSAMMV. Compared with some state-of-the-art algorithms, the numerical simulation results illustrate that HSAMMV has strong global search ability and quite good recovery performance. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Multiple measurement vectors
Compressed sensing
Heuristic search
Simulated annealing
Greedy pursuit
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W