Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004. ,
DOI : 10.1109/TIT.2004.834793
URL : http://authors.library.caltech.edu/9035/1/TROieeetit04a.pdf
Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993. ,
DOI : 10.1109/78.258082
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5769
Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, pp.40-44, 1993. ,
DOI : 10.1109/ACSSC.1993.342465
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.5735
Orthogonal least squares methods and their application to non-linear system identification, International Journal of Control, vol.10, issue.5, pp.1873-1896, 1989. ,
DOI : 10.2307/2284566
Sparse Approximate Solutions to Linear Systems, SIAM Journal on Computing, vol.24, issue.2, pp.227-234, 1995. ,
DOI : 10.1137/S0097539792240406
On the difference between Orthogonal Matching Pursuit and Orthogonal Least Squares, Tech. Rep, 2007. ,
Subset Selection in Regression, 2002. ,
Forward sequential algorithms for best basis selection, IEE Proc. Vision, Image and Signal Processing, pp.235-244, 1999. ,
DOI : 10.1049/ip-vis:19990445
Optimized orthogonal matching pursuit approach, IEEE Signal Processing Letters, vol.9, issue.4, pp.137-140, 2002. ,
DOI : 10.1109/LSP.2002.1001652
Computational methods for sparse solution of linear inverse problems Applications of sparse representation and compressive sensing, Proc. IEEE, pp.948-958, 2010. ,
Rank Awareness in Joint Sparse Recovery, IEEE Transactions on Information Theory, vol.58, issue.2, pp.1135-1146, 2012. ,
DOI : 10.1109/TIT.2011.2173722
URL : https://hal.archives-ouvertes.fr/hal-00706058
Fast Solution of <formula formulatype="inline"><tex>$\ell _{1}$</tex> </formula>-Norm Minimization Problems When the Solution May Be Sparse, IEEE Transactions on Information Theory, vol.54, issue.11, pp.4789-4812, 2008. ,
DOI : 10.1109/TIT.2008.929958
Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4395-4401, 2010. ,
DOI : 10.1109/TIT.2010.2054653
The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing, IEEE Transactions on Information Theory, vol.58, issue.4, pp.2040-2047, 2012. ,
DOI : 10.1109/TIT.2011.2177632
A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.6, pp.3654-3656, 2012. ,
DOI : 10.1109/TIT.2012.2185923
On Polar Polytopes and the Recovery of Sparse Representations, IEEE Transactions on Information Theory, vol.53, issue.9, pp.3188-3195, 2007. ,
DOI : 10.1109/TIT.2007.903129
URL : https://hal.archives-ouvertes.fr/hal-00839327
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.53, issue.12, pp.4655-4666, 2007. ,
DOI : 10.1109/TIT.2007.909108
Orthogonal matching pursuit from noisy measurements: A new analysis, Neural Information Processing Systems, pp.540-548, 2009. ,
Optimally sparse representation in general (non-orthogonal) dictionaries via ? 1 minimization, Proc. Natl. Acad. Sci. USA, pp.2197-2202, 2003. ,
Sparse Recovery With Orthogonal Matching Pursuit Under RIP, IEEE Transactions on Information Theory, vol.57, issue.9, pp.6215-6221, 2011. ,
DOI : 10.1109/TIT.2011.2162263
URL : http://arxiv.org/abs/1005.2249
Stability and Robustness of Weak Orthogonal Matching Pursuits, AMS Spring, Southeastern Conference, 2011. ,
DOI : 10.1007/978-1-4614-4565-4_30
Neighborly polytopes and sparse solutions of underdetermined linear equations, Research Report, 2004. ,
On Sparse Representations in Arbitrary Redundant Bases, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1341-1344, 2004. ,
DOI : 10.1109/TIT.2004.828141
Greedy deconvolution of point-like objects, Signal Processing with Adaptive Sparse Structured Representations (SPARS workshop), pp.1-6, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00369571
From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration, IEEE Transactions on Signal Processing, vol.59, issue.10, pp.4572-4584, 2011. ,
DOI : 10.1109/TSP.2011.2160633
Sparse deconvolution: Comparison of statistical and deterministic approaches, 2011 IEEE Statistical Signal Processing Workshop (SSP), 2005. ,
DOI : 10.1109/SSP.2011.5967691
URL : https://hal.archives-ouvertes.fr/hal-00583135
Messagepassing algorithms for compressed sensing, Proceedings of the National Academy of Sciences of the USA, pp.1-6, 2009. ,
Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.2, pp.1094-1121, 2012. ,
DOI : 10.1109/TIT.2011.2173241
Sparse spike deconvolution with minimum scale, Signal Processing with Adaptive Sparse Structured Representations (SPARS workshop), pp.1-4, 2005. ,
Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithms, Advances in Computational Mathematics, vol.49, issue.6, pp.23-41, 2008. ,
DOI : 10.1007/s10444-005-9009-5
URL : https://hal.archives-ouvertes.fr/inria-00544767
Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3320-3325, 2003. ,
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00570057