Title
On Theorem 10 in “On Polar Polytopes and the Recovery of Sparse Representations” [Sep 07 3188-3195]
Abstract
It is shown that Theorem 10 (Non-Nestedness of ERC) in [Plumbley, IEEE Trans. Inf. Theory, vol. 53, pp. 3188–3195, Sep. 2007] neglects the derivations of the exact recovery conditions (ERCs) of constrained $\\ell_{1}$ -minimization (BP) and orthogonal matching pursuit. This means that it does not reflect the recovery properties of these algorithms. Furthermore, an ERC of BP more general than that in [Tropp, IEEE Trans. Inf. Theory, vol. 50, pp. 2231–2242, Oct. 2004] is shown.
Year
DOI
Venue
2013
10.1109/TIT.2013.2259294
IEEE Transactions on Information Theory
Keywords
Field
DocType
compressed sensing,iterative methods,minimisation
Matching pursuit,Discrete mathematics,Combinatorics,Basis pursuit denoising,Iterative method,Polytope,Polar,Compressed sensing,Mathematics
Journal
Volume
Issue
ISSN
59
8
0018-9448
Citations 
PageRank 
References 
0
0.34
1
Authors
3
Name
Order
Citations
PageRank
Bob L. Sturm124129.88
Boris Mailhé21037.22
M. D. Plumbley31915202.38