Results 1 - 10
of
28
Tensor Decompositions and Applications
- SIAM REVIEW
, 2009
"... This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N -way array. Decompositions of higher-order tensors (i.e., N -way arrays with N ⥠3) have applications in psychometrics, chemometrics, signal proce ..."
Abstract
-
Cited by 723 (18 self)
- Add to MetaCart
(Show Context)
This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N -way array. Decompositions of higher-order tensors (i.e., N -way arrays with N ⥠3) have applications in psychometrics, chemometrics, signal processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, etc. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix singular value decompo-
sition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal components analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative variants of all of the above. The N-way Toolbox and Tensor Toolbox, both for MATLAB, and the Multilinear Engine are examples of software packages for working with tensors.
C.: Multichannel nonnegative matrix factorization in convolutive mixtures for audio source separation
- IEEE Trans. Audio, Speech, Language Process
, 2010
"... We consider inference in a general data-driven object-based model of multichannel audio data, assumed generated as a possibly underdetermined convolutive mixture of source signals. Each source is given a model inspired from nonnegative matrix factorization (NMF) with the Itakura-Saito divergence, wh ..."
Abstract
-
Cited by 79 (17 self)
- Add to MetaCart
(Show Context)
We consider inference in a general data-driven object-based model of multichannel audio data, assumed generated as a possibly underdetermined convolutive mixture of source signals. Each source is given a model inspired from nonnegative matrix factorization (NMF) with the Itakura-Saito divergence, which underlies a statistical model of superimposed Gaussian components. We address estimation of the mixing and source parameters using two methods. The first one consists of maximizing the exact joint likelihood of the multichannel data using an expectation-maximization algorithm. The second method consists of maximizing the sum of individual likelihoods of all channels using a multiplicative update algorithm inspired from NMF methodology. Our decomposition algorithms were applied to stereo music and assessed in terms of blind source separation performance. Index Terms — Multichannel audio, nonnegative matrix factorization, nonnegative tensor factorization, underdetermined convolutive blind source separation. 1.
ON TENSORS, SPARSITY, AND NONNEGATIVE FACTORIZATIONS
, 2012
"... Tensors have found application in a variety of fields, ranging from chemometrics to signal processing and beyond. In this paper, we consider the problem of multilinear modeling of sparse count data. Our goal is to develop a descriptive tensor factorization model of such data, along with appropriat ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
Tensors have found application in a variety of fields, ranging from chemometrics to signal processing and beyond. In this paper, we consider the problem of multilinear modeling of sparse count data. Our goal is to develop a descriptive tensor factorization model of such data, along with appropriate algorithms and theory. To do so, we propose that the random variation is best described via a Poisson distribution, which better describes the zeros observed in the data as compared to the typical assumption of a Gaussian distribution. Under a Poisson assumption, we fit a model to observed data using the negative log-likelihood score. We present a new algorithm for Poisson tensor factorization called CANDECOMP–PARAFAC alternating Poisson regression (CP-APR) that is based on a majorization-minimization approach. It can be shown that CP-APR is a generalization of the Lee–Seung multiplicative updates. We show how to prevent the algorithm from converging to non-KKT points and prove convergence of CP-APR under mild conditions. We also explain how to implement CP-APR for large-scale sparse tensors and present results on several data sets, both real and simulated.
Estimating the spatial position of spectral components in audio
- in Proc. Int. Conf. on Independent Component Analysis and Blind Source Separation (ICA
"... Abstract. One way of separating sources from a single mixture recording is by extracting spectral components and then combining them to form estimates of the sources. The grouping process remains a difficult problem. We propose, for instances when multiple mixture signals are available, clustering t ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
(Show Context)
Abstract. One way of separating sources from a single mixture recording is by extracting spectral components and then combining them to form estimates of the sources. The grouping process remains a difficult problem. We propose, for instances when multiple mixture signals are available, clustering the components based on their relative contribution to each mixture (i.e., their spatial position). We introduce novel factorizations of magnitude spectrograms from multiple recordings and derive update rules that extend independent subspace analysis and nonnegative matrix factorization to concurrently estimate the spectral shape, time envelope and spatial position of each component. We show that estimated component positions are near the position of their corresponding source, and that multichannel non-negative matrix factorization can distinguish three pianos by their position in the mixture. 1
Sparse non-negative tensor factorization using columnwise coordinate descent
- Pattern Recognition
, 2012
"... Many applications in computer vision, biomedical informatics, and graphics deal with data in the matrix or tensor form. Non-negative matrix and tensor factoriza-tion, which extract data-dependent non-negative basis functions, have been com-monly applied for the analysis of such data for data compres ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
Many applications in computer vision, biomedical informatics, and graphics deal with data in the matrix or tensor form. Non-negative matrix and tensor factoriza-tion, which extract data-dependent non-negative basis functions, have been com-monly applied for the analysis of such data for data compression, visualization, and detection of hidden information (factors). In this paper, we present a fast and flexible algorithm for sparse non-negative tensor factorization (SNTF) based on columnwise coordinate descent (CCD). Different from the traditional coordi-nate descent which updates one element at a time, CCD updates one column vec-tor simultaneously. Our empirical results on higher-mode images, such as brain MRI images, gene expression images, and hyperspectral images show that the proposed algorithm is 1-2 orders of magnitude faster than several state-of-the-art algorithms. Key words:
Notes on nonnegative tensor factorization of the spectrogram for audio source separation : statistical insights and towards self-clustering of the spatial cues
- in 7th International Symposium on Computer Music Modeling and Retrieval (CMMR
, 2010
"... Abstract. Nonnegative tensor factorization (NTF) of multichannel spectrograms under PARAFAC structure has recently been proposed by Fitzgerald et al as a mean of performing blind source separation (BSS) of multichannel audio data. In this paper we investigate the statistical source models implied by ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
(Show Context)
Abstract. Nonnegative tensor factorization (NTF) of multichannel spectrograms under PARAFAC structure has recently been proposed by Fitzgerald et al as a mean of performing blind source separation (BSS) of multichannel audio data. In this paper we investigate the statistical source models implied by this approach. We show that it implicitly assumes a nonpoint-source model contrasting with usual BSS assumptions and we clarify the links between the measure of fit chosen for the NTF and the implied statistical distribution of the sources. While the original approach of Fitzgeral et al requires a posterior clustering of the spatial cues to group the NTF components into sources, we discuss means of performing the clustering within the factorization. In the results section we test the impact of the simplifying nonpoint-source assumption on underdetermined linear instantaneous mixtures of musical sources and discuss the limits of the approach for such mixtures.
Multichannel extensions of non-negative matrix factorization with complex-valued data
- IEEE Transactions on Audio, Speech and Language Processing
, 2013
"... Abstract—This paper presents new formulations and algorithms for multichannel extensions of non-negative matrix factorization (NMF). The formulations employ Hermitian positive semidefinite matrices to represent a multichannel version of non-negative elements. Multichannel Euclidean distance and mult ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
Abstract—This paper presents new formulations and algorithms for multichannel extensions of non-negative matrix factorization (NMF). The formulations employ Hermitian positive semidefinite matrices to represent a multichannel version of non-negative elements. Multichannel Euclidean distance and multichannel Itakura-Saito (IS) divergence are defined based on appropriate statistical models utilizing multivariate complex Gaussian distri-butions. To minimize this distance/divergence, efficient optimiza-tion algorithms in the form of multiplicative updates are derived by using properly designed auxiliary functions. Two methods are proposed for clustering NMF bases according to the estimated spatial property. Convolutive blind source separation (BSS) is performed by the multichannel extensions of NMF with the clus-tering mechanism. Experimental results show that 1) the derived multiplicative update rules exhibited good convergence behavior, and 2) BSS tasks for several music sources with two microphones and three instrumental parts were evaluated successfully. Index Terms—Blind source separation, clustering, convolutive mixture, multichannel, non-negative matrix factorization. I.
Fast Nonnegative Tensor Factorization with an Active-Set-Like Method
"... Abstract We introduce an efficient algorithm for computing a low-ranknonnegativeCANDECOMP/PARAFAC(NNCP)decomposition.Intextmining, signal processing, and computer vision among other areas, imposing nonnegativity constraints to the low-rank factors of matrices and tensors has been shown an effective ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Abstract We introduce an efficient algorithm for computing a low-ranknonnegativeCANDECOMP/PARAFAC(NNCP)decomposition.Intextmining, signal processing, and computer vision among other areas, imposing nonnegativity constraints to the low-rank factors of matrices and tensors has been shown an effective technique providing physically meaningful interpretation. A principled methodology for computing NNCP is alternating nonnegative least squares, in which the nonnegativity-constrained least squares (NNLS) problems are solved in each iteration. In this chapter, we propose to solve the NNLS problems using the block principal pivoting method. The block principal pivoting method overcomes some difficulties of the classical active method for the NNLS problems with a large number of variables. We introducetechniquestoacceleratetheblockprincipalpivotingmethodformultiple right-hand sides, which is typical in NNCP computation. Computational experiments show the state-of-the-art performance of the proposed method. 1
New formulations and efficient algorithms for multichannel NMF
- in Proc. WASPAA ’11
, 2011
"... This paper proposes new formulations and algorithms for a multi-channel extension of nonnegative matrix factorization (NMF), in-tending convolutive sound source separation with multiple micro-phones. The proposed formulation employs Hermitian positive semidefinite matrices to represent a multichanne ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
(Show Context)
This paper proposes new formulations and algorithms for a multi-channel extension of nonnegative matrix factorization (NMF), in-tending convolutive sound source separation with multiple micro-phones. The proposed formulation employs Hermitian positive semidefinite matrices to represent a multichannel version of non-negative elements. Such matrices are basically estimated for NMF bases, but a source separation task can be performed by introducing variables that relate NMF bases and sources. Efficient optimiza-tion algorithms in the form of multiplicative updates are derived by using properly designed auxiliary functions. Experimental results show that two instrumental sounds coming from different directions were successfully separated by the proposed algorithm. Index Terms — nonnegative matrix factorization, multichan-nel, positive semidefinite, auxiliary function, source separation 1.
Multichannel audio upmixing based on non-negative tensor factorization representation
- In IEEE Workshop Applications of Signal Processing to Audio and Acoustics (WASPAA), New Paltz
, 2011
"... This paper proposes a new spatial audio coding (SAC) method that is based on parametrization of multichannel audio by sound objects using non-negative tensor factorization (NTF). The spatial param-eters are estimated using perceptually motivated NTF model and are used for upmixing a downmixed and en ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
(Show Context)
This paper proposes a new spatial audio coding (SAC) method that is based on parametrization of multichannel audio by sound objects using non-negative tensor factorization (NTF). The spatial param-eters are estimated using perceptually motivated NTF model and are used for upmixing a downmixed and encoded mixture signal. The performance of the proposed coding is evaluated using listen-ing tests, which prove the coding performance being on a par with conventional SAC methods. Additionally the proposed coding en-ables controlling the upmix content by meaningful objects. Index Terms — Spatial audio coding, Object-based audio cod-ing, Non-negative tensor factorization
