4.6 Article

A heuristic search algorithm for the multiple measurement vectors problem

Journal

SIGNAL PROCESSING
Volume 100, Issue -, Pages 1-8

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.sigpro.2014.01.002

Keywords

Multiple measurement vectors; Compressed sensing; Heuristic search; Simulated annealing; Greedy pursuit

Funding

  1. National Natural Science Foundation of China [61271014, 61201328]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available