Compressive Principal Component Pursuit

Details Compressive Principal Component Pursuit Compressive Principal Component Pursuit

2012-02-21

arxiv.org/abs/1202.4596v1

Computer Science

Information Theory

30 pages, 1 figure, preliminary version submitted to ISIT'12

Scientific paper

We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in compressed sensing of structured high-dimensional signals such as videos and hyperspectral images, as well as in the analysis of transformation invariant low-rank recovery. We analyze the performance of the natural convex heuristic for solving this problem, under the assumption that measurements are chosen uniformly at random. We prove that this heuristic exactly recovers low-rank and sparse terms, provided the number of observations exceeds the number of intrinsic degrees of freedom of the component signals by a polylogarithmic factor. Our analysis introduces several ideas that may be of independent interest for the more general problem of compressed sensing and decomposing superpositions of multiple structured signals.

Affiliated with

Also associated with

No associations

Rating

Compressive Principal Component Pursuit 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 Compressive Principal Component Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressive Principal Component Pursuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-423365