Article

Underdetermined Sparse Blind Source Separation of Nonnegative and Partially Overlapped Data.

SIAM Journal on Scientific Computing (Impact Factor: 1.94). 01/2011; 33:2063-2094. DOI: 10.1137/100788434
Source: DBLP

ABSTRACT We study the solvability of sparse blind separation of $n$ nonnegative sources from $m$ linear mixtures in the underdetermined regime $m<n$. The geometric properties of the mixture matrix and the sparseness structure of the source matrix are closely related to the identification of the mixing matrix. We first illustrate and establish necessary and sufficient conditions for the unique separation for the case of $m$ mixtures and $m+1$ sources, and develop a novel algorithm based on data geometry, source sparseness, and $\ell_1$ minimization. Then we extend the results to any order $m\times n$, $3\leq m<n$, based on the degree of degeneracy of the columns of the mixing matrix. Numerical results substantiate the proposed solvability conditions and show satisfactory performance of our approach.

0 Bookmarks
 · 
48 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Motivated by applications in nuclear magnetic resonance (NMR) spectroscopy, we introduce a novel blind source separation (BSS) approach to treat nonnegative and correlated data. We consider the (over)-determined case where n sources are to be separated from m linear mixtures (m≥n). Among the n source signals, there are n-1 partially overlapping (Po) sources and one positive everywhere (Pe) source. This condition is applicable for many real-world signals such as NMR spectra of urine and blood serum for metabolic fingerprinting and disease diagnosis. The geometric properties of the mixture matrix and the sparseness structure of the source signals (in a transformed domain) are crucial to the identification of the mixing matrix and the sources. The method first identifies the mixing coefficients of the Pe source by exploiting geometry in data clustering. Then subsequent elimination of variables leads to a sub-BSS problem of the Po sources solvable by the minimal cone method and related linear programming. The last step is based on solving a convex ℓ 1 minimization problem to extract the Pe source signals. Numerical results on NMR spectra show satisfactory performance of the method.
    SIAM Journal on Imaging Sciences 07/2012; 5(3). DOI:10.1137/110827223 · 2.87 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Given a set of mixtures, blind source separation attempts to retrieve the source signals without or with very little information of the mixing process. We present a geometric approach for blind separation of nonnegative linear mixtures termed {\em facet component analysis}. The approach is based on facet identification of the underlying cone structure of the data. Earlier works focus on recovering the cone by locating its vertices (vertex component analysis) based on a mutual sparsity condition which requires each source signal to possess a stand-alone peak in its spectrum. We formulate alternative conditions so that enough data points fall on the facets of a cone instead of accumulating around the vertices. To find a regime of unique solvability, we make use of both geometric and density properties of the data points, and develop an efficient facet identification method by combining data classification and linear regression. For noisy data, total variation technique may be employed. We show computational results on nuclear magnetic resonance spectroscopic data to substantiate our method.
    Signal Image and Video Processing 09/2014; DOI:10.1007/s11760-014-0696-6. · 1.02 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns), which is equivalent to the hyperspectral unmixing problem under the linear mixing model and the pure-pixel assumption. We present a family of fast recursive algorithms, and prove they are robust under any small perturbations of the input data matrix. This family generalizes several existing hyperspectral unmixing algorithms and hence provides for the first time a theoretical justification of their better practical performance.
    IEEE Transactions on Pattern Analysis and Machine Intelligence 08/2012; DOI:10.1109/TPAMI.2013.226 · 5.69 Impact Factor