File(s) under permanent embargo
Nonnegative blind source separation by sparse component analysis based on determinant measure
journal contributionposted on 2012-10-01, 00:00 authored by Zuyuan Yang, Yong XiangYong Xiang, S Xie, S Ding, Y Rong
The problem of nonnegative blind source separation (NBSS) is addressed in this paper, where both the sources and the mixing matrix are nonnegative. Because many real-world signals are sparse, we deal with NBSS by sparse component analysis. First, a determinant-based sparseness measure, named D-measure, is introduced to gauge the temporal and spatial sparseness of signals. Based on this measure, a new NBSS model is derived, and an iterative sparseness maximization (ISM) approach is proposed to solve this model. In the ISM approach, the NBSS problem can be cast into row-to-row optimizations with respect to the unmixing matrix, and then the quadratic programming (QP) technique is used to optimize each row. Furthermore, we analyze the source identifiability and the computational complexity of the proposed ISM-QP method. The new method requires relatively weak conditions on the sources and the mixing matrix, has high computational efficiency, and is easy to implement. Simulation results demonstrate the effectiveness of our method.
JournalIEEE transactions on neural networks and learning systems
Pagination1601 - 1610
LocationPiscataway, N. J.
Publication classificationC1 Refereed article in a scholarly journal
blind source separation (BSS)determinant-based sparseness measurenonnegative sourcessparse component analysisScience & TechnologyTechnologyComputer Science, Artificial IntelligenceComputer Science, Hardware & ArchitectureComputer Science, Theory & MethodsEngineering, Electrical & ElectronicComputer ScienceEngineeringMATRIXALGORITHMSREPRESENTATIONMIXTURE