Analysis and extension of existing bounds in compressed sensing

This paper presents analysis and extension about known bounds in compressed basing on the Orthogonal Matching Pursuit algorithm. In the noiseless case, we focus on factors such as Restricted Isometry Property (RIP), Mutual Incoherence Property (MIP) and the recovery order of entries. For the noisy c...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang Feng, Yi Ke-chu, Xiang Xin, Sun Ye, Wang Juan
Format: Conference Proceeding
Language:English
Subjects:
Compressed sensing
Educational institutions
Matching pursuit algorithms
Mutual Incoherence Property(MIP)
Noise Folding
Noise measurement
Orthogonal Matching Pursuit (OMP)
Signal to noise ratio
Sparse matrices
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents analysis and extension about known bounds in compressed basing on the Orthogonal Matching Pursuit algorithm. In the noiseless case, we focus on factors such as Restricted Isometry Property (RIP), Mutual Incoherence Property (MIP) and the recovery order of entries. For the noisy compressed sensing, we have proved two corollaries, exploiting the idea of noise folding, and obtained an upper bound of Signal-to-Noise Ratios (SNR) for the exact recovery.
DOI:10.1109/ICSPCC.2011.6061743