Abstract
StOMP algorithm is well suited to large-scale underdetermined applications in sparse vector estimations. It can reduce computation complexity and has some attractive asymptotical statistical properties. However, the estimation speed is at the cost of accuracy violation. This paper suggests an improvement on the StOMP algorithm that is more efficient in finding a sparse solution to the large-scale underdetermined problems. Also, compared with StOMP, this modified algorithm can not only more accurately estimate parameters for the distribution of matched filter coefficients, but also improve estimation accuracy for the sparse vector itself. Theoretical success boundary is provided based on a large-system limit for approximate recovery of sparse vector by modified algorithm, which validates that the modified algorithm is more efficient than StOMP. Actual computations with simulated data show that without significant increment in computation time, the proposed algorithm can greatly improve the estimation accuracy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruckstein A M, Donoho D L, Elad M. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev, 2009, 51: 34–81
Candes E J, Tao T. Near optimal signal recovery from random projections: universal encoding strategies? IEEE Trans Inf Theory, 2006, 52: 5406–5425
Marbach D, Schaffter T, Mattiussi C, et al. Generating realistic in silico gene networks for performance assessment of reverse engineering methods. J Comput Biol, 2009, 16: 229–239
Rudelson M, Vershynin R. Geometric approach to error-correcting codes and reconstruction of signals. Int Math Res Notices, 2005, 2005: 4019–4041
Zhou T, Wang Y L. Causal relationship inference for a large-scale cellular network. Bioinformatics, 2010, 26: 2020–2028
Wang Y L, Zhou T. A relative variation-based method to unraveling gene regulatory networks. PLoS One, 2012, 7: e31194
Xiong J, Zhou T. Gene regulatory network inference from multifactorial perturbation data using both regression and correlation analyses. PLoS One, 2012, 7: e43819
Davenport M A, Wakin M B. Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans Inf Theory, 2010, 56: 4395–4401
Dai W, Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inf Theory, 2009, 55: 2230–2249
Bryt O, Elad M. Compression of facial images using the K-SVD algorithm. J Vrs Commun Image Rep, 2008, 19: 270–283
Donoho D L. For most large under-determined systems of linear equations, the minimal l 1-norm solution is also the sparsest solution. Commun Pure Appl Math, 2006, 59: 797–829
Candes E J, Tao T. Decoding via linear programming. IEEE Trans Inf Theory, 2005, 51: 4203–4215
Starck J L, Elad M, Donoho D L. Image decomposition via the combination of sparse representation and a variational approach. IEEE Trans Image Process, 2005, 14: 1570–1582
Candes E J. The restricted isometry property and its implications for compressed sensing. CR Math, 2008, 346: 589–592
Mallat S, Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Proces, 1993, 41: 3397–3415
Tropp J A. Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory, 2004, 50: 2231–2242
Candes E, Romberg J, Tao T. Stable signal recovery from incomplete and inaccurate measurements. Comm Pure Appl Math, 2006, 59: 1207–1223
Tropp J A, Gilbert A C. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inf Theory, 2007, 53: 4655–4666
Fuchs J J. On sparse representations in arbitrary redundant bases. IEEE Trans Inf Theory, 2004, 50: 1341–1344
Gribonval R, Nielsen M. Sparse representations in unions of bases. IEEE Trans Inf Theory, 2003, 49: 3320–3325
Pati Y C, Rezaiifar R, Krishnaprasad P S. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 1993. 40–44
Zhang T. Sparse recovery with orthogonal matching pursuit under RIP. IEEE Trans Inform Theory, 2011, 57: 6215–6221
Blumensath T, Davies M E. Iterative thresholding for sparse approximations. J Fourier Anal Appl, 2008, 14: 629–654
Blumensath T, Davies M E. Iterative hard thresholding for compressed sensing. Appl Comput Harmon A, 2009, 27: 265–274
Dai W, Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inform Theory, 2009, 55: 2230–2249
Needell D, Tropp J A. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon A, 2009, 26: 301–321
Needell D, Vershynin R. Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J STSP, 2010, 4: 310–316
Donoho D, Tsaig Y, Drori I, et al. Sparse solutions of under-determined linear equations by stage-wise orthogonal matching pursuit. IEEE Trans Inf Theory, 2012, 58: 1094–1120
Wang J, Kwon S, Shim B. Generalized orthogonal matching pursuit. IEEE Trans Signal Proces, 2012, 60: 4973–4976
Wang J, Shim B. On the recovery limit of sparse signal using orthogonal matching pursuit. IEEE Trans Signal Proces, 2012, 60: 6202–6216
Zhang W H, Huang B X, Zhou T. An improvement on StOMP for sparse solution of linear under-determined problem. In: Proceeding of the 32nd Chinese Control Conference, Xi’an, 2013. 1951–1956
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, W., Zhou, T. & Huang, B. Outlier deletion based improvement on the StOMP algorithm for sparse solution of large-scale underdetermined problems. Sci. China Inf. Sci. 57, 1–14 (2014). https://doi.org/10.1007/s11432-014-5118-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-014-5118-4