File(s) under permanent embargo
A convex geometry-based blind source separation method for separating nonnegative sources
journal contribution
posted on 2015-08-01, 00:00 authored by Zuyuan Yang, Yong XiangYong Xiang, Y Rong, K XieThis paper presents a convex geometry (CG)-based method for blind separation of nonnegative sources. First, the unaccessible source matrix is normalized to be column-sum-to-one by mapping the available observation matrix. Then, its zero-samples are found by searching the facets of the convex hull spanned by the mapped observations. Considering these zero-samples, a quadratic cost function with respect to each row of the unmixing matrix, together with a linear constraint in relation to the involved variables, is proposed. Upon which, an algorithm is presented to estimate the unmixing matrix by solving a classical convex optimization problem. Unlike the traditional blind source separation (BSS) methods, the CG-based method does not require the independence assumption, nor the uncorrelation assumption. Compared with the BSS methods that are specifically designed to distinguish between nonnegative sources, the proposed method requires a weaker sparsity condition. Provided simulation results illustrate the performance of our method.
History
Journal
IEEE trans neural networks and learning systemsVolume
26Issue
8Pagination
1635 - 1644Publisher
IEEELocation
Piscataway, N.J.Publisher DOI
eISSN
2162-2388Language
engPublication classification
C Journal article; C1 Refereed article in a scholarly journalCopyright notice
2015, IEEEUsage metrics
Categories
No categories selectedKeywords
blind source separation (BSS)convex geometry (CG)correlated sourcesnonnegative sourcesScience & TechnologyTechnologyComputer Science, Artificial IntelligenceComputer Science, Hardware & ArchitectureComputer Science, Theory & MethodsEngineering, Electrical & ElectronicComputer ScienceEngineeringCOMPONENT ANALYSISMATRIXALGORITHM
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC