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

Bob L. Sturm, Boris Mailhé, Mark Plumbley

Research output: Contribution to journalJournal articleResearchpeer-review

324 Downloads (Pure)

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 \(\ell_1\)-minimization (BP) and
orthogonal matching pursuit (OMP),
and thus 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.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Volume59
Issue number8
Pages (from-to)5206-5209
Number of pages4
ISSN0018-9448
DOIs
Publication statusPublished - Aug 2013

Fingerprint

Dive into the research topics of 'On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations"'. Together they form a unique fingerprint.

Cite this