DocumentCode :
2945598
Title :
Compressed sensing over the Grassmann manifold: A unified analytical framework
Author :
Xu, Weiyu ; Hassibi, Babak
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA
fYear :
2008
fDate :
23-26 Sept. 2008
Firstpage :
562
Lastpage :
567
Abstract :
It is well known that compressed sensing problems reduce to finding the sparse solutions for large under-determined systems of equations. Although finding the sparse solutions in general may be computationally difficult, starting with the seminal work of [2], it has been shown that linear programming techniques, obtained from an l1-norm relaxation of the original non-convex problem, can provably find the unknown vector in certain instances. In particular, using a certain restricted isometry property, [2] shows that for measurement matrices chosen from a random Gaussian ensemble, l1 optimization can find the correct solution with overwhelming probability even when the support size of the unknown vector is proportional to its dimension. The paper [1] uses results on neighborly polytopes from [6] to give a ldquosharprdquo bound on what this proportionality should be in the Gaussian measurement ensemble. In this paper we shall focus on finding sharp bounds on the recovery of ldquoapproximately sparserdquo signals (also possibly under noisy measurements). While the restricted isometry property can be used to study the recovery of approximately sparse signals (and also in the presence of noisy measurements), the obtained bounds can be quite loose. On the other hand, the neighborly polytopes technique which yields sharp bounds for ideally sparse signals cannot be generalized to approximately sparse signals. In this paper, starting from a necessary and sufficient condition for achieving a certain signal recovery accuracy, using high-dimensional geometry, we give a unified null-space Grassmannian angle-based analytical framework for compressive sensing. This new framework gives sharp quantitative tradeoffs between the signal sparsity and the recovery accuracy of the l1 optimization for approximately sparse signals. As it will turn out, the neighborly polytopes result of [1] for ideally sparse signals can be viewed as a special case of ours. O- - ur result concerns fundamental properties of linear subspaces and so may be of independent mathematical interest.
Keywords :
Gaussian processes; information theory; linear programming; random processes; Grassmann manifold; compressed sensing; linear programming; random Gaussian ensemble; signal sparsity; Compressed sensing; Equations; Geometry; Linear programming; Manifolds; Particle measurements; Signal analysis; Size measurement; Sufficient conditions; Vectors; Grassmann angle; Grassmann manifold; basis pursuit; compressed sensing; convex polytopes; geometric probability; high-dimensional integral geometry; k-balancedness; l1-optimization; neighborly polytopes; random linear subspaces;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location :
Urbana-Champaign, IL
Print_ISBN :
978-1-4244-2925-7
Electronic_ISBN :
978-1-4244-2926-4
Type :
conf
DOI :
10.1109/ALLERTON.2008.4797608
Filename :
4797608
Link To Document :
بازگشت