RIP-based near-oracle performance guarantees for SP, CoSaMP, and IHT

Raja Giryes; Michael Elad

doi:10.1109/TSP.2011.2174985

RIP-based near-oracle performance guarantees for SP, CoSaMP, and IHT

Raja Giryes, Michael Elad

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

This correspondence presents an average case denoising performance analysis for SP, CoSaMP, and IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that it is corrupted by an additive random zero-mean white Gaussian noise and has a K-sparse representation with respect to a known dictionary bf D. The proposed analysis is based on the RIP, establishing a near-oracle performance guarantee for each of these algorithms. Beyond bounds for the reconstruction error that hold with high probability, in this work we also provide a bound for the average error.

Original language	English
Article number	6071013
Pages (from-to)	1465-1468
Number of pages	4
Journal	IEEE Transactions on Signal Processing
Volume	60
Issue number	3
DOIs	https://doi.org/10.1109/TSP.2011.2174985
State	Published - Mar 2012

Keywords

Additive white noise
Gaussian noise
compressed sensing
signal denoising
signal reconstruction
signal representations

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering

Access to Document

10.1109/TSP.2011.2174985

Cite this

@article{b31ce223a4b946b3a30b7f864d09e71d,

title = "RIP-based near-oracle performance guarantees for SP, CoSaMP, and IHT",

abstract = "This correspondence presents an average case denoising performance analysis for SP, CoSaMP, and IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that it is corrupted by an additive random zero-mean white Gaussian noise and has a K-sparse representation with respect to a known dictionary bf D. The proposed analysis is based on the RIP, establishing a near-oracle performance guarantee for each of these algorithms. Beyond bounds for the reconstruction error that hold with high probability, in this work we also provide a bound for the average error.",

keywords = "Additive white noise, Gaussian noise, compressed sensing, signal denoising, signal reconstruction, signal representations",

author = "Raja Giryes and Michael Elad",

note = "Funding Information: Manuscript received January 18, 2011; revised July 08, 2011 and October 09, 2011; accepted October 12, 2011. Date of publication November 07, 2011; date of current version February 10, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Philippe Ciblat. This research was supported by the European Community FP7-FET program, SMALL project, under grant agreement 225913. The work of R. Giryes is supported in part by the Azrieli Foundation through an Azrieli Fellowship.",

year = "2012",

month = mar,

doi = "10.1109/TSP.2011.2174985",

language = "الإنجليزيّة",

volume = "60",

pages = "1465--1468",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - RIP-based near-oracle performance guarantees for SP, CoSaMP, and IHT

AU - Giryes, Raja

AU - Elad, Michael

N1 - Funding Information: Manuscript received January 18, 2011; revised July 08, 2011 and October 09, 2011; accepted October 12, 2011. Date of publication November 07, 2011; date of current version February 10, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Philippe Ciblat. This research was supported by the European Community FP7-FET program, SMALL project, under grant agreement 225913. The work of R. Giryes is supported in part by the Azrieli Foundation through an Azrieli Fellowship.

PY - 2012/3

Y1 - 2012/3

N2 - This correspondence presents an average case denoising performance analysis for SP, CoSaMP, and IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that it is corrupted by an additive random zero-mean white Gaussian noise and has a K-sparse representation with respect to a known dictionary bf D. The proposed analysis is based on the RIP, establishing a near-oracle performance guarantee for each of these algorithms. Beyond bounds for the reconstruction error that hold with high probability, in this work we also provide a bound for the average error.

AB - This correspondence presents an average case denoising performance analysis for SP, CoSaMP, and IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that it is corrupted by an additive random zero-mean white Gaussian noise and has a K-sparse representation with respect to a known dictionary bf D. The proposed analysis is based on the RIP, establishing a near-oracle performance guarantee for each of these algorithms. Beyond bounds for the reconstruction error that hold with high probability, in this work we also provide a bound for the average error.

KW - Additive white noise

KW - Gaussian noise

KW - compressed sensing

KW - signal denoising

KW - signal reconstruction

KW - signal representations

UR - http://www.scopus.com/inward/record.url?scp=84857213851&partnerID=8YFLogxK

U2 - 10.1109/TSP.2011.2174985

DO - 10.1109/TSP.2011.2174985

M3 - مقالة

SN - 1053-587X

VL - 60

SP - 1465

EP - 1468

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 3

M1 - 6071013

ER -

RIP-based near-oracle performance guarantees for SP, CoSaMP, and IHT

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this