On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit

Orthogonal matching pursuit (OMP) is a greedy search algorithm popularly being used for the recovery of compressive sensed sparse signals. In this correspondence, we show that if the isometry constant δK+1 of the sensing matrix Φ satisfies δK+1 <; 1/(1/√K+1) then the OMP algorithm can perfectly recover K-sparse signals from the compressed measurements y=Φx. Our bound offers a substantial improvement over the recent result of Davenport and Wakin and also closes gap between the recovery bound and fundamental limit over which the perfect recovery of the OMP cannot be guaranteed.