DocumentCode
3058410
Title
Underdetermined Sparse Blind Source Separation by Clustering on Hyperplanes
Author
Beihai Tan ; Min, Zhao
Author_Institution
Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou, China
Volume
1
fYear
2009
fDate
22-24 May 2009
Firstpage
270
Lastpage
274
Abstract
In the underdetermined blind source separation and sparse component analysis, we get sensor signals X = AS, where x isin Rmxn, A isin Rmxn, S isin Rmxn, because the mixed matrix A and source signals S aren´t known and m < n , namely, the number of sensor signals less than that of source signals, but we can know source signals are sparse, so we use the information to recover source signals by estimating the mixed matrix. This paper gives an algorithm for estimating mixed matrix based on sparse sources information in underdetermined blind separation by clustering on hyperplanes´ normal lines, and the good performance is shown by the last example.
Keywords
blind source separation; estimation theory; independent component analysis; pattern clustering; signal restoration; sparse matrices; clustering; mixed matrix estimation; sensor signal; source signal recovery; sparse component analysis; sparse source information; underdetermined sparse blind source separation; Algorithm design and analysis; Blind source separation; Clustering algorithms; Electronic commerce; Equations; Information analysis; Information security; Signal analysis; Source separation; Sparse matrices; blind separation; mixed matrix; normal line; sparse presentation; underdetermined mixture;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on
Conference_Location
Nanchang
Print_ISBN
978-0-7695-3643-9
Type
conf
DOI
10.1109/ISECS.2009.151
Filename
5209854
Link To Document