Blind Source Separation with Compressively Sensed Linear Mixtures

Details Blind Source Separation with Compressively Sensed Linear Mixtures Blind Source Separation with Compressively Sensed Linear Mixtures

2011-10-12

arxiv.org/abs/1110.2593v1

Computer Science

Information Theory

9 pages, 2 figures

Scientific paper

This work studies the problem of simultaneously separating and reconstructing signals from compressively sensed linear mixtures. We assume that all source signals share a common sparse representation basis. The approach combines classical Compressive Sensing (CS) theory with a linear mixing model. It allows the mixtures to be sampled independently of each other. If samples are acquired in the time domain, this means that the sensors need not be synchronized. Since Blind Source Separation (BSS) from a linear mixture is only possible up to permutation and scaling, factoring out these ambiguities leads to a minimization problem on the so-called oblique manifold. We develop a geometric conjugate subgradient method that scales to large systems for solving the problem. Numerical results demonstrate the promising performance of the proposed algorithm compared to several state of the art methods.

Affiliated with

Also associated with

No associations

Rating

Blind Source Separation with Compressively Sensed Linear Mixtures 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 Blind Source Separation with Compressively Sensed Linear Mixtures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blind Source Separation with Compressively Sensed Linear Mixtures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633145