A New Generalized Orthogonal Matching Pursuit Method

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correction to "Generalized Orthogonal Matching Pursuit"

As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using restricted isometry property (RIP). We show that if the measurement matrix Φ ∈ R satisfies the RIP with δmax{9,S+1}K ≤ 1 8 , then gOMP performs stable re...

متن کامل

A sharp bound on RIC in generalized orthogonal matching pursuit

Generalized orthogonal matching pursuit (gOMP) algorithm has received much attention in recent years as a natural extension of orthogonal matching pursuit. It is used to recover sparse signals in compressive sensing. In this paper, a new bound is obtained for the exact reconstruction of every K-sparse signal via the gOMP algorithm in the noiseless case. That is, if the restricted isometry const...

متن کامل

Improved Bounds on RIP for Generalized Orthogonal Matching Pursuit

Generalized Orthogonal Matching Pursuit (gOMP) is a natural extension of OMP algorithm where unlike OMP, it may select N(≥ 1) atoms in each iteration. In this paper, we demonstrate that gOMP can successfully reconstruct a K-sparse signal from a compressed measurement y = Φx by K iteration if the sensing matrix Φ satisfies restricted isometry property (RIP) of order NK where δNK < √ N √ K+2 √ N ...

متن کامل

A New Look at Generalized Orthogonal Matching Pursuit: Stable Signal Recovery under Measurement Noise

Generalized orthogonal matching pursuit (gOMP) is an extension of orthogonal matching pursuit (OMP) algorithm designed to improve the recovery performance of sparse signals. In this paper, we provide a new analysis for the gOMP algorithm for both noiseless and noisy scenarios. We show that if the measurement matrix Φ ∈ R satisfies the restricted isometry property (RIP) with δ7K+N−1 ≤ 0.0231, th...

متن کامل

Orthogonal Matching Pursuit from Noisy Measurements: A New Analysis∗

A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from m = 4k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix with a probability that approaches one as n → ∞. This work strengthens this result by showing that a lower number of measurements, m = 2k log(n − k), is in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Electrical and Computer Engineering

سال: 2017

ISSN: 2090-0147,2090-0155

DOI: 10.1155/2017/3458054