Compressed Sensing and Affine Rank Minimization Under Restricted Isometry

This paper establishes new restricted isometry conditions for compressed sensing and affine rank minimization. It is shown for compressed sensing that δ\u3c;i\u3ekA\u3c;/i\u3e+θ\u3c;i\u3ek\u3c;/i\u3e,\u3c;i\u3ekA\u3c;/i\u3e \u3c; 1 guarantees the exact recovery of all \u3c;i\u3ek\u3c;/i\u3e sparse signals in the noiseless case through the constrained \u3c;i\u3el\u3c;/i\u3e\u3c;sub\u3e1\u3c;/sub\u3e minimization. Furthermore, the upper bound 1 is sharp in the sense that for any ε \u3e 0, the condition δ\u3c;i\u3ekA\u3c;/i\u3e + θ\u3c;i\u3ek\u3c;/i\u3e,\u3c;i\u3ekA\u3c;/i\u3e \u3c; 1+ε is not sufficient to guarantee such exact recovery using any recovery method. Similarly, for affine rank minimization, if δ\u3c;i\u3erM\u3c;/i\u3e+θ\u3c;i\u3er\u3c;/i\u3e,\u3c;i\u3erM\u3c;/i\u3e \u3c; 1 then all matrices with rank at most \u3c;i\u3er\u3c;/i\u3e can be reconstructed exactly in the noiseless case via the constrained nuclear norm minimization; and for any ε \u3e 0, δ\u3c;i\u3erM\u3c;/i\u3e +θ\u3c;i\u3er\u3c;/i\u3e,\u3c;i\u3erM\u3c;/i\u3e \u3c; 1+ε does not ensure such exact recovery using any method. Moreover, in the noisy case the conditions δ\u3c;i\u3ekA\u3c;/i\u3e+θ\u3c;i\u3ek\u3c;/i\u3e,\u3c;i\u3ekA\u3c;/i\u3e \u3c; 1 and δ\u3c;i\u3erM\u3c;/i\u3e+θ\u3c;i\u3er\u3c;/i\u3e,\u3c;i\u3erM\u3c;/i\u3e \u3c; 1 are also sufficient for the stable recovery of sparse signals and low-rank matrices respectively. Applications and extensions are also discussed