Title
Blind Source Separation based on Compressed Sensing
Abstract
Blind Source Separation (BSS) is an important issue in the coherent processing of multi-dimensional data. To recover and separate the sources from underdetermined mixtures, some prior information like sparse representation is required. The principle is very similar to the new technique named Compressed Sensing (CS), which asserts that one can recover a sparse signal from a limited number of random projections. In this paper, the relationship between BSS and CS is studied by equivalent transformation, then we propose the linear operator by which the relationship between the sources and the mixtures is modeled in two ways: RIP and incoherence, and give some instructive conclusions for the operator design. Numerical simulation applying the FOOMP algorithm and a operator we propose are conducted to demonstrate the good performance of the whole framework.
Year
DOI
Venue
2011
10.1109/ChinaCom.2011.6158262
CHINACOM
Keywords
Field
DocType
Blind Source Separation, Compressed Sensing, FOOMP, RIP, Redundant Dictionary, Sparsity
Computer simulation,Underdetermined system,Pattern recognition,Computer science,Sparse approximation,Linear map,Operator (computer programming),Artificial intelligence,Numerical analysis,Blind signal separation,Compressed sensing
Conference
Volume
Issue
Citations 
null
null
0
PageRank 
References 
Authors
0.34
8
5
Name
Order
Citations
PageRank
Zhenghua Wu1405.01
Yi Shen2124070.62
Qiang Wang360184.65
Jie Liu4143894.17
Bo Li5192.50