By Topic

Achievable Angles Between Two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ling-Hua Chang ; Dept. of Electr. & Comput. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Jwo-Yuh Wu

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems. Assuming that u and v are two sparse vectors with∠ (u, v) = θ and the sensing matrix Φ satisfies RIP, this paper is aimed at analytically characterizing the achievable angles between Φu and Φv. Motivated by geometric interpretations of RIP and with the aid of the well-known law of cosines, we propose a plane-geometry-based formulation for the study of the considered problem. It is shown that all the RIP-induced norm/distance constraints on Φu and Φv can be jointly depicted via a simple geometric diagram in the 2-D plane. This allows for a joint analysis of all the considered algebraic constraints from a geometric perspective. By conducting plane geometry analyses based on the constructed diagram, closed-form formulas for the maximal and minimal achievable angles are derived. Computer simulations confirm that the proposed solution is tighter than an existing algebraic-based estimate derived using the polarization identity. The obtained results are used to derive a tighter restricted isometry constant of structured sensing matrices of a certain kind, to wit, those in the form of a product of an orthogonal projection matrix and a random sensing matrix. Follow-up applications in CS are also discussed.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 4 )