Nonnegative Blind Source Separation Research Articles

High-order nonnegative blind source separation based on edge features

High-order nonnegative blind source separation based on edge features

Can we realize nonnegative blind source separation with incomplete matrix?

Can we realize nonnegative blind source separation with incomplete matrix?

Nonnegative Blind Source Separation for Ill-Conditioned Mixtures via John Ellipsoid.

Nonnegative blind source separation (nBSS) is often a challenging inverse problem, namely, when the mixing system is ill-conditioned. In this work, we focus on an important nBSS instance, known as hyperspectral unmixing (HU) in remote sensing. HU is a matrix factorization problem aimed at factoring the so-called endmember matrix, holding the material hyperspectral signatures, and the abundance matrix, holding the material fractions at each image pixel. The hyperspectral signatures are usually highly correlated, leading to a fast decay of the singular values (and, hence, high condition number) of the endmember matrix, so HU often introduces an ill-conditioned nBSS scenario. We introduce a new theoretical framework to attack such tough scenarios via the John ellipsoid (JE) in functional analysis. The idea is to identify the maximum volume ellipsoid inscribed in the data convex hull, followed by affinely mapping such ellipsoid into a Euclidean ball. By applying the same affine mapping to the data mixtures, we prove that the endmember matrix associated with the mapped data has condition number 1, the lowest possible, and that these (preconditioned) endmembers form a regular simplex. Exploiting this regular structure, we design a novel nBSS criterion with a provable identifiability guarantee and devise an algorithm to realize the criterion. Moreover, for the first time, the optimization problem for computing JE is exactly solved for a large-scale instance; our solver employs a split augmented Lagrangian shrinkage algorithm with all proximal operators solved by closed-form solutions. The competitiveness of the proposed method is illustrated by numerical simulations and real data experiments.

Tensor decomposition of hyperspectral images to study autofluorescence in age-related macular degeneration.

Autofluorescence is the emission of light by naturally occurring tissue components on the absorption of incident light. Autofluorescence within the eye is associated with several disorders, such as Age-related Macular Degeneration (AMD) which is a leading cause of central vision loss. Its pathogenesis is incompletely understood, but endogenous fluorophores in retinal tissue might play a role. Hyperspectral fluorescence microscopy of ex-vivo retinal tissue can be used to determine the fluorescence emission spectra of these fluorophores. Comparisons of spectra in healthy and diseased tissues can provide important insights into the pathogenesis of AMD. However, the spectrum from each pixel of the hyperspectral image is a superposition of spectra from multiple overlapping tissue components. As spectra cannot be negative, there is a need for a non-negative blind source separation model to isolate individual spectra. We propose a tensor formulation by leveraging multiple excitation wavelengths to excite the tissue sample. Arranging images from different excitation wavelengths as a tensor, a non-negative tensor decomposition can be performed to recover a provably unique low-rank model with factors representing emission and excitation spectra of these materials and corresponding abundance maps of autofluorescent substances in the tissue sample. We iteratively impute missing values common in fluorescence measurements using Expectation-Maximization and use L2 regularization to reduce ill-posedness. Further, we present a framework for performing group hypothesis testing on hyperspectral images, finding significant differences in spectra between AMD and control groups in the peripheral macula. In the absence of ground truth, i.e. molecular identification of fluorophores, we provide a rigorous validation of chosen methods on both synthetic and real images where fluorescence spectra are known. These methodologies can be applied to the study of other pathologies presenting autofluorescence that can be captured by hyperspectral imaging.

Detection of Sources in Non-Negative Blind Source Separation by Minimum Description Length Criterion.

While non-negative blind source separation (nBSS) has found many successful applications in science and engineering, model order selection, determining the number of sources, remains a critical yet unresolved problem. Various model order selection methods have been proposed and applied to real-world data sets but with limited success, with both order over- and under-estimation reported. By studying existing schemes, we have found that the unsatisfactory results are mainly due to invalid assumptions, model oversimplification, subjective thresholding, and/or to assumptions made solely for mathematical convenience. Building on our earlier work that reformulated model order selection for nBSS with more realistic assumptions and models, we report a newly and formally revised model order selection criterion rooted in the minimum description length (MDL) principle. Adopting widely invoked assumptions for achieving a unique nBSS solution, we consider the mixing matrix as consisting of deterministic unknowns, with the source signals following a multivariate Dirichlet distribution. We derive a computationally efficient, stochastic algorithm to obtain approximate maximum-likelihood estimates of model parameters and apply Monte Carlo integration to determine the description length. Our modeling and estimation strategy exploits the characteristic geometry of the data simplex in nBSS. We validate our nBSS-MDL criterion through extensive simulation studies and on four real-world data sets, demonstrating its strong performance and general applicability to nBSS. The proposed nBSS-MDL criterion consistently detects the true number of sources, in all of our case studies.

Blind Nonnegative Source Separation Using Biological Neural Networks.

Blind source separation-the extraction of independent sources from a mixture-is an important problem for both artificial and natural signal processing. Here, we address a special case of this problem when sources (but not the mixing matrix) are known to be nonnegative-for example, due to the physical nature of the sources. We search for the solution to this problem that can be implemented using biologically plausible neural networks. Specifically, we consider the online setting where the data set is streamed to a neural network. The novelty of our approach is that we formulate blind nonnegative source separation as a similarity matching problem and derive neural networks from the similarity matching objective. Importantly, synaptic weights in our networks are updated according to biologically plausible local learning rules.

Temporal Unmixing of Dynamic Fluorescent Images by Blind Source Separation Method with a Convex Framework.

By recording a time series of tomographic images, dynamic fluorescence molecular tomography (FMT) allows exploring perfusion, biodistribution, and pharmacokinetics of labeled substances in vivo. Usually, dynamic tomographic images are first reconstructed frame by frame, and then unmixing based on principle component analysis (PCA) or independent component analysis (ICA) is performed to detect and visualize functional structures with different kinetic patterns. PCA and ICA assume sources are statistically uncorrelated or independent and don't perform well when correlated sources are present. In this paper, we deduce the relationship between the measured imaging data and the kinetic patterns and present a temporal unmixing approach, which is based on nonnegative blind source separation (BSS) method with a convex analysis framework to separate the measured data. The presented method requires no assumption on source independence or zero correlations. Several numerical simulations and phantom experiments are conducted to investigate the performance of the proposed temporal unmixing method. The results indicate that it is feasible to unmix the measured data before the tomographic reconstruction and the BSS based method provides better unmixing quality compared with PCA and ICA.

A Convex Geometry-Based Blind Source Separation Method for Separating Nonnegative Sources.

This 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.

Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation

In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive projection algorithm (SPA), but takes advantage of the nonnegativity constraint in the decomposition. We prove that SNPA is more robust than SPA and can be applied to a broader class of nonnegative matrices. This is illustrated on some synthetic data sets, and on a real-world hyperspectral image.

NMF with Sparse Regularizations in Transformed Domains

Non-negative blind source separation (non-negative BSS), which is also referred to as non-negative matrix factorization (NMF), is a very active field in domains as different as astrophysics, audio processing or biomedical signal processing. In this context, the efficient retrieval of the sources requires the use of signal priors such as sparsity. If NMF has now been well studied with sparse constraints in the direct domain, only very few algorithms can encompass non-negativity together with sparsity in a transformed domain since simultaneously dealing with two priors in two different domains is challenging. In this article, we show how a sparse NMF algorithm coined non-negative generalized morphological component analysis (nGMCA) can be extended to impose non-negativity in the direct domain along with sparsity in a transformed domain, with both analysis and synthesis formulations. To our knowledge, this work presents the first comparison of analysis and synthesis priors ---as well as their reweighted versions--- in the context of blind source separation. Comparisons with state-of-the-art NMF algorithms on realistic data show the efficiency as well as the robustness of the proposed algorithms.

Non-Negative Blind Source Separation Algorithm Based on Minimum Aperture Simplicial Cone

We address the problem of Blind Source Separation (BSS) when the hidden sources are Nonnegative (N-BSS). In this case, the scatter plot of the mixed data is contained within the simplicial cone generated by the columns of the mixing matrix. The proposed method, termed SCSA-UNS for Simplicial Cone Shrinking Algorithm for Unmixing Non-negative Sources, aims at estimating the mixing matrix and the sources by fitting a Minimum Aperture Simplicial Cone (MASC) to the cloud of mixed data points. SCSA-UNS is evaluated on both independent and correlated synthetic data and compared to other N-BSS methods. Simulations are also performed on real Liquid Chromatography-Mass Spectrum (LC-MS) data for the metabolomic analysis of a chemical sample, and on real dynamic Positron Emission Tomography (PET) images, in order to study the pharmacokinetics of the [18F]-FDG (FluoroDeoxyGlucose) tracer in the brain.

Blind source separation and automatic tissue typing of microdiffraction data by hierarchical nonnegative matrix factorization

In this article a nonnegative blind source separation technique, known as nonnegative matrix factorization, is applied to microdiffraction data in order to extract characteristic patterns and to determine their spatial distribution in tissue typing problems occurring in bone-tissue engineering. In contrast to other blind source separation methods, nonnegative matrix factorization only requires nonnegative constraints on the extracted sources and corresponding weights, which makes it suitable for the analysis of data occurring in a variety of applications. In particular, here nonnegative matrix factorization is hierarchically applied to two-dimensional meshes of X-ray diffraction data measured in bone samples with implanted tissue. Such data are characterized by nonnegative profiles and their analysis provides significant information about the structure of possibly new deposited bone tissue. A simulation and real data studies show that the proposed method is able to retrieve the patterns of interest and to provide a reliable and accurate segmentation of the given X-ray diffraction data.

Sparse and Non-Negative BSS for Noisy Data

Non-negative blind source separation (BSS) has raised interest in various fields of research, as testified by the wide literature on the topic of non-negative matrix factorization (NMF). In this context, it is fundamental that the sources to be estimated present some diversity in order to be efficiently retrieved. Sparsity is known to enhance such contrast between the sources while producing very robust approaches, especially to noise. In this paper, we introduce a new algorithm in order to tackle the blind separation of non-negative sparse sources from noisy measurements. We first show that sparsity and non-negativity constraints have to be carefully applied on the sought-after solution. In fact, improperly constrained solutions are unlikely to be stable and are therefore sub-optimal. The proposed algorithm, named nGMCA (non-negative Generalized Morphological Component Analysis), makes use of proximal calculus techniques to provide properly constrained solutions. The performance of nGMCA compared to other state-of-the-art algorithms is demonstrated by numerical experiments encompassing a wide variety of settings, with negligible parameter tuning. In particular, nGMCA is shown to provide robustness to noise and performs well on synthetic mixtures of real NMR spectra.

Projection-pursuit-based method for blind separation of nonnegative sources.

This paper presents a projection pursuit (PP) based method for blind separation of nonnegative sources. First, the available observation matrix is mapped to construct a new mixing model, in which the inaccessible source matrix is normalized to be column-sum-to-1. Then, the PP method is proposed to solve this new model, where the mixing matrix is estimated column by column through tracing the projections to the mapped observations in specified directions, which leads to the recovery of the sources. The proposed method is much faster than Chan's method, which has similar assumptions to ours, due to the usage of optimal projection. It is also more advantageous in separating cross-correlated sources than the independence- and uncorrelation-based methods, as it does not employ any statistical information of the sources. Furthermore, the new method does not require the mixing matrix to be nonnegative. Simulation results demonstrate the superior performance of our method.

Nonnegative blind source separation by sparse component analysis based on determinant measure.

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.

Quantifying brain tumor tissue abundance in HR-MAS spectra using non-negative blind source separation techniques

Given high-resolution magic angle spinning (HR-MAS) spectra from several glial tumor subjects, our goal is to differentiate between tumor tissue types by separating the different sources that contribute to the profile of each spectrum. Blind source separation techniques are applied for obtaining characteristic profiles for necrosis, highly cellular tumor and border tumor tissue and providing the contribution (abundance) of each of these tumor tissue types to the profile of each spectrum. The problem is formulated as a non-negative source separation problem. Non-negative matrix factorization, convex analysis of non-negative sources and non-negative independent component analysis methods are considered. The results are in agreement with the pathology obtained by the histopathological examination that succeeded the HR-MAS measurements. Furthermore, an analysis to verify to which extent the dimension of the input space, the input features and the number of sources to be extracted from the HR-MAS data could influence the performance of the source separation is presented. Copyright © 2012 John Wiley & Sons, Ltd.

Maximum contrast analysis for nonnegative blind source separation

In this paper, we propose a maximum contrast analysis (MCA) method for nonnegative blind source separation, where both the mixing matrix and the source signals are nonnegative. We first show that the contrast degree of the source signals is greater than that of the mixed signals. Motivated by this observation, we propose an MCA-based cost function. It is further shown that the separation matrix can be obtained by maximizing the proposed cost function. Then we derive an iterative determinant maximization algorithm for estimating the separation matrix. In the case of two sources, a closed-form solution exists and is derived. Unlike most existing blind source separation methods, the proposed MCA method needs neither the independence assumption, nor the sparseness requirement of the sources. The effectiveness of the new method is illustrated by experiments using X-ray images, remote sensing images, infrared spectral images, and real-world fluorescence microscopy images.

Joint processing of the parallel and crossed polarized Raman spectra and uniqueness in blind nonnegative source separation

Polarization analysis in Raman spectroscopy provides a powerful tool in chemical physics to identify the symmetry of the vibration modes of molecules, macromolecules and crystals, according to their crystallographic structure and local spatial orientation. In this paper we propose two new approaches in polarized Raman spectroscopy for data with rotational and spatial diversity, respectively. We show that the joint use of parallel and crossed polarization data yields more accurate source separation results and improves the uniqueness properties of the solution in blind nonnegative source separation algorithms. The proposed approaches are validated on two real polarized Raman data sets.

A Nonnegative Blind Source Separation Model for Binary Test Data

A novel method called binNMF is introduced which aimed to extract hidden information from multivariate binary data sets. The method treats the problem in the spirit of blind source separation: The data are assumed to be generated by a superposition of several simultaneously acting sources or elementary causes which are not observable directly. The superposition process is based on a minimum of assumptions and reversed to identify the underlying sources. The method is motivated, developed, and demonstrated in the context of binary wafer test data which evolve during microchip fabrication.

Nonnegative Least-Correlated Component Analysis for Separation of Dependent Sources by Volume Maximization

Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challenging task. In this paper, a joint correlation function of multiple signals is proposed to reveal and confirm that the observations after nonnegative mixing would have higher joint correlation than the original unknown sources. Accordingly, a new nonnegative least-correlated component analysis (n/LCA) method is proposed to design the unmixing matrix by minimizing the joint correlation function among the estimated nonnegative sources. In addition to a closed-form solution for unmixing two mixtures of two sources, the general algorithm of n/LCA for the multisource case is developed based on an iterative volume maximization (IVM) principle and linear programming. The source identifiability and required conditions are discussed and proven. The proposed n/LCA algorithm, denoted by n/LCA-IVM, is evaluated with both simulation data and real biomedical data to demonstrate its superior performance over several existing benchmark methods.