Abstract and Applied Analysis

Volume 2013 (2013), Article ID 482357, 3 pages

http://dx.doi.org/10.1155/2013/482357

Research Article

A Sharp RIP Condition for Orthogonal Matching Pursuit

Wei Dan

School of Mathematics and Statistics, Guangdong University of Finance & Economics, Guangzhou 510320, China

Received 3 July 2013; Revised 14 September 2013; Accepted 5 October 2013

Academic Editor: Sergei V. Pereverzyev

Copyright © 2013 Wei Dan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

A restricted isometry property (RIP) condition is known to be sufficient for orthogonal matching pursuit (OMP) to exactly recover every K-sparse signal x from measurements . This paper is devoted to demonstrate that this condition is sharp. We construct a specific matrix with such that OMP cannot exactly recover some K-sparse signals.

1. Introduction

Compressive sampling (compressed sensing, CS) is known as a new type of sampling theory that one can reconstruct a high dimensional spare signal from a small number of linear measurements at the sub-Nyquist rate [1–3]. Nowadays, the CS technique has attracted considerable attention from across a wide array of fields like applied mathematics, statistics, and engineering, including signal processing areas such as MR imaging, speech processing, and analog to digital conversion. The basic problem in CS is to reconstruct the unknown sparse signal from measurements:

where is an sampling matrix. Suppose , where denotes the th column of . Throughout the paper, we will assume that the columns of are normalized; that is, for .

It is well understood that under some assumptions on the sampling matrix , the unknown sparse signal can be reconstructed by solving the -minimization problem:

where denotes the number of nonzero entries of . We say a signal is -sparse when .

However, the optimization problem is NP-hard, so one seeks computationally efficient algorithms to approximate the sparse signal , such as greedy algorithm, minimization, and minimization [4–6].

Orthogonal matching pursuit (OMP), which is a canonical greedy algorithm, has receive much attention in solving the problem (2), due to its ease of implementation and low complexity. Algorithm 1 can be described below. Until recently, many popular generalizations of OMP are introduced, for example, OMMP and KOMP; for details, see [7, 8].

Input: Sampling matrix , observation

Output: Reconstructed sparse vector and index set

INITIALIZATION: Let the index set and the residual . Let the iteration counter .

IDENTIFICATION: Choose the index subject to .

UPDATE: Add the new index to the index set: , and update the signal and the residual

                                                    ;

                                                         .

If , stop the algorithm. Otherwise, update the iteration counter and return to Step IDENTIFICATION.

Algorithm 1: Orthogonal matching pursuit—OMP ().

The mutual incoherence property (MIP) introduced in [9] is an important tool to analyze the performance of OMP. The MIP requires the mutual coherence of the sampling matrix to be small, where is defined as

Tropp has shown that the MIP condition is sufficient for OMP to exactly recover every -sparse signal [6]. This condition is proved to be sharp in [10].

The restricted isometry property (RIP) is also widely used in studying a large number of algorithms for sparse recovery in CS, which is introduced in [11]. A matrix satisfies the RIP of order with the restricted isometry constant (RIC) if is the smallest constant such that

holds for all -sparse signal . A related quantity of the restricted orthogonality constant (ROC) is defined as the smallest quantity such that

holds for all disjoint support -sparse signal and -sparse signal . It is first shown by Davenport and Wakin that the RIP condition

can guarantee that OMP will exactly recover every -sparse signal [12]. The sufficient condition is then improved to [13], [14], [7], and [15, 16]. By contrast, Mo and Shen have given a counterexample, a matrix with where OMP fails for some -sparse signals [17]. The main result of this note is to show that the sufficient RIP condition

is sharp for OMP.

2. Main Result

Theorem 1. For any given positive integer , there exist a -sparse signal and a matrix with the restricted isometry constant

for which OMP fails in iterations.

Proof. For any given positive integer , let

where

By simple calculation, we can get

for any integers .

Thus, for any index set whose cardinality is , we have

It is obvious that the eigenvalues of are

Therefore, the restricted isometry constant of is .

Now, we turn to calculate the restricted orthogonality constant . In view of (11), we may, without loss of generality, assume that and . We have

The last equality holds when . It is easy to check that

Let ; we have

This implies that OMP fails in the first iteration. The proof is complete.

3. Discussion

In this paper, we showed that the RIP condition is sharp for orthogonal matching pursuit to exactly recover every -sparse signal from measurements . It is worth discussing the relations between our sharp RIP condition and that in two relative papers [10, 17]. First of all, it follows from the facts that and that the sharp RIP condition in this paper is weaker than the sharp MIP condition in [10]. Moreover, our result is also stronger than the previous RIP condition. The condition in this paper is necessary and sufficient for OMP, while the previous necessary RIP condition in [17] is not sufficient. Therefore, the result in the paper may guide the practitioners to apply OMP properly in sparse recovery.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant nos. 11271060, U0935004, U1135003, 11071031, and 11290143, 11101096), the Guangdong Natural Science Foundation (Grant no. S2012010010376), and the Guangdong University and Colleges Technology Innovation Projects (Grant no. 2012KJCX0048).

References

E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489–509, 2006.

D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.

Z. Xu, “Compressed sensing: a survey,” Scientia Sinica Mathematica, vol. 42, no. 9, pp. 865–877, 2012.

D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via minimization,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 5, pp. 2197–2202, 2003.

R. Saab and Y. Yılmaz, “Sparse recovery by non-convex optimization—instance optimality,” Applied and Computational Harmonic Analysis, vol. 29, no. 1, pp. 30–48, 2010.

J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231–2242, 2004.

R. Maleh, “Improved RIP analysis of orthogonal matching pursuit,” 2011, http://arxiv.org/abs/1102.4311

Z. Xu, “The performance of orthogonal multi-matching pursuit under RIP,” 2012, http://arxiv.org/abs/1210.5323

D. L. Donoho and X. Huo, “Uncertainty principles and ideal atomic decomposition,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2845–2862, 2001.

T. T. Cai, L. Wang, and G. Xu, “Stable recovery of sparse signals and an oracle inequality,” IEEE Transactions on Information Theory, vol. 56, no. 7, pp. 3516–3522, 2010.

E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005.

M. A. Davenport and M. B. Wakin, “Analysis of orthogonal matching pursuit using the restricted isometry property,” IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4395–4401, 2010.

S. Huang and J. Zhu, “Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP,” Inverse Problems, vol. 27, no. 3, Article ID 035003, 14 pages, 2011.

E. Liu and V. N. Temlyakov, “The orthogonal super greedy algorithm and applications in compressed sensing,” IEEE Transactions on Information Theory, vol. 58, no. 4, pp. 2040–2047, 2012.

W. Dan and R. H. Wang, “Robustness of orthogonal matching pursuit under restricted isometry property,” Science China Mathematics, vol. 56, 2013.

J. Wang and B. Shim, “Improved recovery bounds of orthogonal matching pursuit using restricted isometry property,” 2012, http://arxiv-web3.library.cornell.edu/abs/1211.4293v1

Q. Mo and Y. Shen, “A remark on the restricted isometry property in orthogonal matching pursuit,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3654–3656, 2012.