7 research outputs found

    Machine Learning Source Separation Using Maximum a Posteriori Nonnegative Matrix Factorization

    Get PDF
    A novel unsupervised machine learning algorithm for single channel source separation is presented. The proposed method is based on nonnegative matrix factorization, which is optimized under the framework of maximum a posteriori probability and Itakura-Saito divergence. The method enables a generalized criterion for variable sparseness to be imposed onto the solution and prior information to be explicitly incorporated through the basis vectors. In addition, the method is scale invariant where both low and high energy components of a signal are treated with equal importance. The proposed algorithm is a more complete and efficient approach for matrix factorization of signals that exhibit temporal dependency of the frequency patterns. Experimental tests have been conducted and compared with other algorithms to verify the efficiency of the proposed method

    Explicit–implicit mapping approach to nonlinear blind separation of sparse nonnegative dependent sources from a single mixture: pure component extraction from nonlinear mixture mass spectra

    Get PDF
    The nonlinear, nonnegative single-mixture blind source separation (BSS) problem consists of decomposing observed nonlinearly mixed multicomponent signal into nonnegative dependent component (source) signals. The problem is difficult and is a special case of the underdetermined BSS problem. However, it is practically relevant for the contemporary metabolic profiling of biological samples when only one sample is available for acquiring mass spectra ; afterwards, the pure components are extracted. Herein, we present a method for the blind separation of nonnegative dependent sources from a single, nonlinear mixture. First, an explicit feature map is used to map a single mixture into a pseudo multi-mixture. Second, an empirical kernel map is used for implicit mapping of a pseudo multi-mixture into a high-dimensional reproducible kernel Hilbert space (RKHS). Under sparse probabilistic conditions that were previously imposed on sources, the single-mixture nonlinear problem is converted into an equivalent linear, multiple-mixture problem that consists of the original sources and their higher order monomials. These monomials are suppressed by robust principal component analysis, hard-, soft- and trimmed thresholding. Sparseness constrained nonnegative matrix factorizations in RKHS yield sets of separated components. Afterwards, separated components are annotated with the pure components from the library using the maximal correlation criterion. The proposed method is depicted with a numerical example that is related to the extraction of 8 dependent components from 1 nonlinear mixture. The method is further demonstrated on 3 nonlinear chemical reactions of peptide synthesis in which 25, 19 and 28 dependent analytes are extracted from 1 nonlinear mixture mass spectra. The goal application of the proposed method is, in combination with other separation techniques, mass spectrometry-based non-targeted metabolic profiling, such as biomarker identification studies

    Machine Learning Source Separation Using Maximum A Posteriori Nonnegative Matrix Factorization

    No full text

    Underdetermined convolutive source separation using two dimensional non-negative factorization techniques

    Get PDF
    PhD ThesisIn this thesis the underdetermined audio source separation has been considered, that is, estimating the original audio sources from the observed mixture when the number of audio sources is greater than the number of channels. The separation has been carried out using two approaches; the blind audio source separation and the informed audio source separation. The blind audio source separation approach depends on the mixture signal only and it assumes that the separation has been accomplished without any prior information (or as little as possible) about the sources. The informed audio source separation uses the exemplar in addition to the mixture signal to emulate the targeted speech signal to be separated. Both approaches are based on the two dimensional factorization techniques that decompose the signal into two tensors that are convolved in both the temporal and spectral directions. Both approaches are applied on the convolutive mixture and the high-reverberant convolutive mixture which are more realistic than the instantaneous mixture. In this work a novel algorithm based on the nonnegative matrix factor two dimensional deconvolution (NMF2D) with adaptive sparsity has been proposed to separate the audio sources that have been mixed in an underdetermined convolutive mixture. Additionally, a novel Gamma Exponential Process has been proposed for estimating the convolutive parameters and number of components of the NMF2D/ NTF2D, and to initialize the NMF2D parameters. In addition, the effects of different window length have been investigated to determine the best fit model that suit the characteristics of the audio signal. Furthermore, a novel algorithm, namely the fusion K models of full-rank weighted nonnegative tensor factor two dimensional deconvolution (K-wNTF2D) has been proposed. The K-wNTF2D is developed for its ability in modelling both the spectral and temporal changes, and the spatial covariance matrix that addresses the high reverberation problem. Variable sparsity that derived from the Gibbs distribution is optimized under the Itakura-Saito divergence and adapted into the K-wNTF2D model. The tensors of this algorithm have been initialized by a novel initialization method, namely the SVD two-dimensional deconvolution (SVD2D). Finally, two novel informed source separation algorithms, namely, the semi-exemplar based algorithm and the exemplar-based algorithm, have been proposed. These algorithms based on the NMF2D model and the proposed two dimensional nonnegative matrix partial co-factorization (2DNMPCF) model. The idea of incorporating the exemplar is to inform the proposed separation algorithms about the targeted signal to be separated by initializing its parameters and guide the proposed separation algorithms. The adaptive sparsity is derived for both ii of the proposed algorithms. Also, a multistage of the proposed exemplar based algorithm has been proposed in order to further enhance the separation performance. Results have shown that the proposed separation algorithms are very promising, more flexible, and offer an alternative model to the conventional methods
    corecore