On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations" - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2013

On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations"

Abstract

It is shown that Theorem 10 (Non-Nestedness of ERC) in [Plumbley, IEEE Trans. Info. Theory, vol. 53, pp. 3188, Sep. 2007] neglects the derivations of the exact recovery conditions (ERCs) of constrained 1-minimization (BP) and orthogonal matching pursuit (OMP). 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. Info. Theory, vol. 50, pp. 2231, Oct. 2004] is shown.
Fichier principal
Vignette du fichier
nestedERC20130404-2.pdf (336.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00839327 , version 1 (27-06-2013)

Identifiers

Cite

Bob L. Sturm, Boris Mailhé, Mark D. Plumbley. On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations". IEEE Transactions on Information Theory, 2013, ⟨10.1109/TIT.2013.2259294⟩. ⟨hal-00839327⟩
107 View
113 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More