Sampling and reconstructing signals from a union of linear subspaces

Details Sampling and reconstructing signals from a union of linear subspaces Sampling and reconstructing signals from a union of linear subspaces

2009-11-18

arxiv.org/abs/0911.3514v2

Computer Science

Information Theory

Scientific paper

In this note we study the problem of sampling and reconstructing signals which are assumed to lie on or close to one of several subspaces of a Hilbert space. Importantly, we here consider a very general setting in which we allow infinitely many subspaces in infinite dimensional Hilbert spaces. This general approach allows us to unify many results derived recently in areas such as compressed sensing, affine rank minimisation and analog compressed sensing. Our main contribution is to show that a conceptually simple iterative projection algorithms is able to recover signals from a union of subspaces whenever the sampling operator satisfies a bi-Lipschitz embedding condition. Importantly, this result holds for all Hilbert spaces and unions of subspaces, as long as the sampling procedure satisfies the condition for the set of subspaces considered. In addition to recent results for finite unions of finite dimensional subspaces and infinite unions of subspaces in finite dimensional spaces, we also show that this bi-Lipschitz property can hold in an analog compressed sensing setting in which we have an infinite union of infinite dimensional subspaces living in infinite dimensional space.

Affiliated with

Also associated with

No associations

Rating

Sampling and reconstructing signals from a union of linear subspaces 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 Sampling and reconstructing signals from a union of linear subspaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling and reconstructing signals from a union of linear subspaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241105