High-Dimensional Matched Subspace Detection When Data are Missing

Details High-Dimensional Matched Subspace Detection When Data are Missing High-Dimensional Matched Subspace Detection When Data are Missing

2010-02-03

arxiv.org/abs/1002.0852v2

Computer Science

Information Theory

Scientific paper

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 R^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.

Affiliated with

Also associated with

No associations

Rating

High-Dimensional Matched Subspace Detection When Data are Missing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-Dimensional Matched Subspace Detection When Data are Missing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-Dimensional Matched Subspace Detection When Data are Missing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154173