Achievable angles between two compressed sparse vectors under RIP-induced norm/distance constraints

Ling Hua Chang, Jwo-Yuh Wu

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

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 an important role in the studies of many compressive sensing (CS) problems. Assuming that (i) u and v are two sparse vectors with {measured angle}(u, v) = θ and (ii) 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 two-dimensional plane. This allows for a joint analysis of all the involved algebraic constraints from a geometric perspective. By conducting plane geometry analyses based on the constructed diagram, closed-form formulae 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.

Original languageEnglish
Pages523-528
Number of pages6
DOIs
StatePublished - 2014
Event2014 International Conference on Computing, Networking and Communications, ICNC 2014 - Honolulu, HI, United States
Duration: 3 Feb 20146 Feb 2014

Conference

Conference2014 International Conference on Computing, Networking and Communications, ICNC 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period3/02/146/02/14

Fingerprint

Dive into the research topics of 'Achievable angles between two compressed sparse vectors under RIP-induced norm/distance constraints'. Together they form a unique fingerprint.

Cite this