Prefer a chat interface with context about you and your work?
An improved RIP-based performance guarantee for sparse signal recovery via orthogonal matching pursuit
A sufficient condition reported very recently for perfect recovery of a K-sparse vector via orthogonal matching pursuit in K iterations is that the restricted isometry constant of the sensing matrix satisfies δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K+1</sub> <; 1/(√K + 1). By exploiting a "near orthogonality" condition specified in terms of the …