Abstract | ||
---|---|---|
We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, well-studied problem when the signal is completely observed. High-dimensional testing problems in which it may be prohibitive or impossible to obtain a complete observation motivate this work. The signal is represented as a vector in ℝn, but we only observe m ≪ n of its elements.We show that reliable detection is possible, under mild incoherence conditions, as long as m is slightly greater than the dimension of the subspace in question. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/ISIT.2010.5513344 | international symposium on information theory |
Keywords | DocType | Volume |
pattern matching,signal processing,high-dimensional testing problem,incomplete signal,matched subspace detection,mild incoherence condition | Journal | abs/1002.0852 |
ISBN | Citations | PageRank |
978-1-4244-7891-0 | 37 | 1.95 |
References | Authors | |
3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Laura Balzano | 1 | 410 | 27.51 |
Benjamin Recht | 2 | 6087 | 309.68 |
Robert Nowak | 3 | 7309 | 672.50 |