基于差值映射的压缩感知MUSIC算法

doi:10.11999/JEIT141542

Abstract
Figure/Table
References (34)
Related Citation (15)

Download: PDF (265 KB)
Export: BibTeX | EndNote (RIS)

Abstract

The Multiple Measurement Vectors (MMV) problem addresses the recovery of unknown input vectors which share the same sparse support. The Compressed Sensing (CS) has the capability of estimating the sparse support even in coherent cases, where the traditional array processing approaches like MUltiple SIgnal Classification (MUSIC) often fail. However, CS guarantees the accurate recovery in a probabilistic manner, and often shows inferior performance in cases where the traditional ways succeed. Recently, a novel compressive MUSIC (or CS-MUSIC) algorithm is proposed by Kim et al., in which both the advantages of CS and traditional MUSIC-like methods are combined together. As an iterative projecting algorithm, Difference Map (DM) is first used to solve the phase retrieval problem in crystallography. Recent results show that it has excellent performance in solving a wide variety of non-convex problems like compressed sensing. In this paper, a DM-based CS-MUSIC algorithm is proposed. Experiments show that the proposed algorithm is very effective in MMV problem solving and the success rate of CS-MUSIC is dramatically improved.

Key words： Compressed Sensing (CS) Multiple Measurement Vectors (MMV) problem Joint sparsity MUltiple SIgnal Classification (MUSIC) Difference Map(DM)

Received: 04 December 2014 Published: 09 June 2015

PACS:

TN911.72

Corresponding Authors: Lü Zhi-feng E-mail: snowby2010@gmail.com

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors
	Lü Zhi-feng
	Lei Hong

Cite this article:

Lü Zhi-feng,Lei Hong. Compressive Sensing MUSIC Algorithm Based on Difference Map[J]. JEIT, 2015, 37(8): 1874-1878.

URL:

http://jeit.ie.ac.cn/EN/ 10.11999/JEIT141542 OR http://jeit.ie.ac.cn/EN/Y2015/V37/I8/1874

[1]	Donoho D. Compressed sensing[J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306.
[2]	Cades E, Romberg J, and Tao T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information[J]. IEEE Transactions on Information Theory, 2006, 52(2): 489-509.
[3]	Fang L Y, Li S T, Ryan P, et al.. Fast acquisition and reconstruction of optical coherence tomography images via sparse representation[J]. IEEE Transactions on Medical Imaging, 2013, 32(11): 2034-2049.
[4]	Yang J, Thompson J, Huang X T, et al.. Segmented reconstruction for compressed sensing SAR imaging[J]. IEEE Transactions on Geoscience and Remote Sensing, 2013, 51(7): 4214-4225.
[5]	Friedland, S, Li Q, and Schonfeld D. Compressive sensing of sparse tensors[J]. IEEE Transactions on Image Processing, 2014, 23(10): 4438-4447.
[6]	Hawes M B and Liu W. Robust sparse antenna array design via compressive sensing[C]. IEEE International Conference on Digital Signal Processing, Nice, France, 2013: 1-5.
[7]	Northardt E T, Bilik I, and Abramovich Y I. Spatial compressive sensing for direction-of-arrival estimation with bias mitigation via expected likelihood[J]. IEEE Transactions on Signal Processing, 2013, 61(5): 1183-1195.
[8]	Nagahara M, Quevedo D E, and Ostergaard J. Sparse packetized predictive control for networked control over erasure channels[J]. IEEE Transactions on Automatic Control, 2014, 59(7): 1899-1905.
[9]	Krim H and Viberg M. Two decades of array signal processing research: the parametric approach[J]. IEEE Signal Processing Magazine, 1996, 13(4): 67-94.
[10]	Schmidt R. Multiple emitter location and signal parameter estimation[J]. IEEE Transactions on Antennas ?and Propagation, 1986, 34(3): 276-280.
[11]	Kim J M, Lee O K, and Ye J C. Compressive MUSIC: revisiting the link between compressive sensing and array signal processing[J]. IEEE Transactions on Information Theory, 2012, 58(1): 278-301.
[12]	Lee K and Bresler Y. Subspace-augmented MUSIC for joint sparse recovery with any rank[C]. Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop, Jerusalem, Israel, 2010: 205-208.
[13]	Elser V. Phase retrieval by iterated projections[J]. Journal of the Optical Society of America A, 2003, 20(1): 40-55.
[14]	Elser V, Rankenburg I, and Thibault P. Searching with iterated maps[J]. Proceedings of the National Academy of Sciences, 2007, 104(2): 418-423.
[15]	Eldar Y C, Sidorenko P, Mixon D G, et al.. Sparse phase retrieval from short-time Fourier measurements[J]. IEEE Signal Processing Letters, 2015, 22(5): 638-642.
[16]	Shechtman Y, Beck A, and Eldar Y C. GESPAR: efficient phase retrieval of sparse signals[J]. IEEE Transactions on Signal Processing, 2014, 62(4): 928-938.
[17]	Qiu K and Dogandzic A. Nonnegative signal reconstruction from compressive samples via a difference map ECME algorithm[C]. Proceedings of the IEEE Statistical Signal Processing Workshop, Nice, France, 2011: 561-564.
[18]	Landecker W, Chartrand R, and DeDeo S. Robust compressed sensing and sparse coding with the difference map[C]. IEEE European Conference on Computer Vision, Zurich, Switzerland, 2014: 315-329.
[19]	Feng P. Universal minimum-rate sampling and spectrum-blind reconstruction for multiband signals[D]. [Ph.D. dissertation], University of Illinois, Urbana-Champaign, 1997.
[20]	Chen J and Huo X. Theoretical results on sparse representations of multiple measurement vectors[J]. IEEE Transactions on Signal Processing, 2006, 54(12): 4634-4643.
[21]	Tropp J A, Gilbert A C, and Strauss M J. Algorithms for simultaneous sparse approximation, Part I: Greedy pursuit[J]. Signal Processing, 2006, 86(3): 572-588.
[22]	Malioutov D, Cetin M, and Willsky A S. A sparse signal reconstruction perspective for source localization with sensor arrays[J]. IEEE Transactions on Signal Processing, 2005, 53(8): 3010-3022.
[23]	Tropp J A. Algorithms for simultaneous sparse approximation. Part II: Convex relaxation[J]. Signal Processing, 2006, 86(3): 589-602.
[24]	Wipf D P. Bayesian methods for finding sparse representations[D]. [Ph.D. dissertation], University of California, San Diego, 2006.
[25]	Mishali M and Eldar Y C. Reduce and boost: recovering arbitrary sets of jointly sparse vectors[J]. IEEE Transactions on Signal Processing, 2008, 56(10): 4692-4702.
[26]	Eldar Y C, Kuppinger P, and Bolcskei H. Compressed sensing of block-sparse signals: uncertainty relations and efficient recovery[J]. IEEE Transactions on Signal Processing, 2010, 58(6): 3042-3054.
[27]	Baraniuk R G, Cevher V, Duarte M F, et al.. Model-based compressive sensing[J]. IEEE Transactions on Information Theory, 2010, 56(4): 1982-2001.
[28]	Capon J. High-resolution frequency-wavenumber spectrum analysis[J]. Proceedings of the IEEE, 1969, 57(8): 1408-1418.
[29]	Roy R and Kailath T. ESPRIT-estimation of signal parameters via rotational invariance techniques[J]. IEEE Transactions on Acoustics, Speech and Signal Processing, 1989, 37(7): 984-995.
[30]	Fienup J R. Phase retrieval algorithms: a comparison[J]. Applied Optics, 1982, 21(15): 2758-2769.
[31]	Bauschke H and Borwein J. On projection algorithms for solving convex feasibility problems[J]. SIAM Review, 1996, 38(3): 367-426.
[32]	Adiga A and Seelamantula C S. An alternating Lp-L2 projections algorithm (ALPA) for speech modeling using sparsity constraints[C]. IEEE International Conference on Digital Signal Processing, Hong Kong, China, 2014: 291-296.
[33]	Yan W, Wang Q, and Shen Y. Shrinkage-based alternating projection algorithm for efficient measurement matrix construction in compressive sensing[J]. IEEE Transactions on Instrumentation and Measurement, 2014, 63(5): 1073-1084.
[34]	Hesse R, Luke D R, and Neumann P. Alternating projections and Douglas-Rachford for sparse affine feasibility[J]. IEEE Transactions on Signal Processing, 2014, 62(18): 4868-4881.