Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2013, Special Issue (2013), Article ID 804640, 8 pages.

Splitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing

Liu Jing, Han ChongZhao, Yao XiangHua, and Lian Feng

Full-text: Open access

Abstract

In this paper, a novel method named as splitting matching pursuit (SMP) is proposed to reconstruct K -sparse signal in compressed sensing. The proposed method selects F l    ( F l > 2 K ) largest components of the correlation vector c , which are divided into F split sets with equal length l . The searching area is thus expanded to incorporate more candidate components, which increases the probability of finding the true components at one iteration. The proposed method does not require the sparsity level K to be known in prior. The Merging, Estimation and Pruning steps are carried out for each split set independently, which makes it especially suitable for parallel computation. The proposed SMP method is then extended to more practical condition, e.g. the direction of arrival (DOA) estimation problem in phased array radar system using compressed sensing. Numerical simulations show that the proposed method succeeds in identifying multiple targets in a sparse radar scene, outperforming other OMP-type methods. The proposed method also obtains more precise estimation of DOA angle using one snapshot compared with the traditional estimation methods such as Capon, APES (amplitude and phase estimation) and GLRT (generalized likelihood ratio test) based on hundreds of snapshots.

Article information

Source
J. Appl. Math., Volume 2013, Special Issue (2013), Article ID 804640, 8 pages.

Dates
First available in Project Euclid: 14 March 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1394806132

Digital Object Identifier
doi:10.1155/2013/804640

Mathematical Reviews number (MathSciNet)
MR3056218

Zentralblatt MATH identifier
1266.94009

Citation

Jing, Liu; ChongZhao, Han; XiangHua, Yao; Feng, Lian. Splitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing. J. Appl. Math. 2013, Special Issue (2013), Article ID 804640, 8 pages. doi:10.1155/2013/804640. https://projecteuclid.org/euclid.jam/1394806132


Export citation

References

  • S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33–61, 1998.
  • S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
  • J. A. Tropp and S. J. Wright, “Computational methods for sparse solution of linear inverse problems,” Proceedings of the IEEE, vol. 98, no. 6, pp. 948–958, 2010.
  • S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397–3415, 1993.
  • J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231–2242, 2004.
  • D. Needell and R. Vershynin, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit,” Foundations of Computational Mathematics, vol. 9, no. 3, pp. 317–334, 2009.
  • W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2230–2249, 2009.
  • D. Needell and J. A. Tropp, “CoSaMP: iterative signal recovery from incomplete and inaccurate samples,” Applied and Computational Harmonic Analysis, vol. 26, no. 3, pp. 301–321, 2009.
  • H. Huang and A. Makur, “Backtracking-based matching pursuit method for sparse signal reconstruction,” IEEE Signal Processing Letters, vol. 18, no. 7, pp. 391–394, 2011.
  • J. Capon, “High resolution frequency-wave number spectrum analysis,” Proceedings of the IEEE, vol. 57, no. 8, pp. 1408–1418, 1969.
  • J. Li and P. Stoica, “An adaptive filtering approach to spectral estimation and SAR imaging,” IEEE Transactions on Signal Processing, vol. 44, no. 6, pp. 1469–1484, 1996.
  • E. J. Kelly, “An adaptive detection algorithm,” IEEE Transactions on Aerospace and Electronic Systems, vol. 22, no. 2, pp. 115–127, 1986.
  • SparseLab, http://dsp.rice.edu/cs.
  • A. C. Gürbüz, J. H. McClellan, and V. Cevher, “A compressive beamforming method,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), pp. 2617–2620, Las Vegas, Nev, USA, April 2008.
  • I. Stojanovic, W. C. Karl, and M. Cetin, “Compressed sensing of mono-static and multi-static SAR,” in Algorithms for Synthetic Aperture Radar Imagery XVI, Proceedings of SPIE, Orlando, Fla, USA, April 2009.
  • J. H. G. Ender, “On compressive sensing applied to radar,” Signal Processing, vol. 90, no. 5, pp. 1402–1414, 2010.
  • Y. Yu, A. P. Petropulu, and H. V. Poor, “Measurement matrix design for compressive sensing-based MIMO radar,” IEEE Transactions on Signal Processing, vol. 59, no. 11, pp. 5338–5352, 2011.
  • J. Zhang, D. Zhu, and G. Zhang, “Adaptive compressed sensing radar oriented toward cognitive detection in dynamic sparse target scene,” IEEE Transactions on Signal Processing, vol. 60, no. 4, pp. 1718–1729, 2012.
  • Y. Chi, L. L. Scharf, A. Pezeshki, and A. R. Calderbank, “Sensitivity to basis mismatch in compressed sensing,” IEEE Transactions on Signal Processing, vol. 59, no. 5, pp. 2182–2195, 2011.
  • Y. Bar-Shalom and T. E. Fortmann, Tracking and Data Association, Academic Press, Orlando, Fla, USA, 1988.