About this Journal Submit a Manuscript Table of Contents 
Computational Intelligence and Neuroscience
Volume 2008 (2008), Article ID 939567, 13 pages
doi:10.1155/2008/939567
Research Article

Fast Nonnegative Matrix Factorization Algorithms Using Projected Gradient Approaches for Large-Scale Problems

Rafal Zdunek1 and Andrzej Cichocki2,3,4

1Instiute of Telecommunications, Teleinformatics and Acoustics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw, Poland
2Laboratory for Advanced Brain Signal Processing, Brain Science Institute RIKEN, Wako-shi, Saitama 351-0198, Japan
3Institute of Theory of Electrical Engineering, Measurement and Information Systems, Faculty of Electrical Engineering, Warsaw University of Technology, 00-661 Warsaw, Poland
4Systems Research Institute, Polish Academy of Science (PAN), 01-447 Warsaw, Poland

Received 15 January 2008; Revised 18 April 2008; Accepted 22 May 2008

Academic Editor: Wenwu Wang

Copyright © 2008 Rafal Zdunek and Andrzej Cichocki. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Recently, a considerable growth of interest in projected gradient (PG) methods has been observed due to their high efficiency in solving large-scale convex minimization problems subject to linear constraints. Since the minimization problems underlying nonnegative matrix factorization (NMF) of large matrices well matches this class of minimization problems, we investigate and test some recent PG methods in the context of their applicability to NMF. In particular, the paper focuses on the following modified methods: projected Landweber, Barzilai-Borwein gradient projection, projected sequential subspace optimization (PSESOP), interior-point Newton (IPN), and sequential coordinate-wise. The proposed and implemented NMF PG algorithms are compared with respect to their performance in terms of signal-to-interference ratio (SIR) and elapsed time, using a simple benchmark of mixed partially dependent nonnegative signals.

1. Introduction and Problem Statement

Nonnegative matrix factorization (NMF) finds such nonnegative factors (matrices) 𝐀 = [ 𝑎 𝑖 𝑗 ] ∈ ℝ 𝐼 × 𝐽 and 𝐗 = [ 𝑥 𝑗 𝑡 ] ∈ ℝ 𝐽 × 𝑇 with a 𝑎 𝑖 𝑗 ≥ 0 , 𝑥 𝑗 𝑡 ≥ 0 that 𝐘 ≅ 𝐀 𝐗 , given the observation matrix 𝐘 = [ 𝑦 𝑖 𝑡 ] ∈ ℝ 𝐼 × 𝑇 , the lower-rank 𝐽 , and possibly other statistical information on the observed data or the factors to be estimated.

This method has found a variety of real-world applications in the areas such as blind separation of images and nonnegative signals [1–6], spectra recovering [7–10], pattern recognition and feature extraction [11–16], dimensionality reduction, segmentation and clustering [17–32], language modeling, text mining [25, 33], music transcription [34], and neurobiology (gene separation) [35, 36].

Depending on an application, the estimated factors may have different interpretation. For example, Lee and Seung [11] introduced NMF as a method for decomposing an image (face) into parts-based representations (parts reminiscent of features such as lips, eyes, nose, etc.). In blind source separation (BSS) [1, 37, 38], the matrix 𝐘 represents the observed mixed (superposed) signals or images, 𝐀 is a mixing operator, and 𝐗 is a matrix of true source signals or images. Each row of 𝐘 or 𝐗 is a signal or 1D image representation, where 𝐼 is a number of observed mixed signals and 𝐽 is a number of hidden (source) components. The index 𝑡 usually denotes a sample (discrete time instant), where 𝑇 is the number of available samples. In BSS, we usually have 𝑇 ≫ 𝐼 ≥ 𝐽 , and 𝐽 is known or can be relatively easily estimated using SVD or PCA.

Our objective is to estimate the mixing matrix 𝐀 and sources 𝐗 subject to nonnegativity constraints of all the entries, given 𝐘 and possibly the knowledge on a statistical distribution of noisy disturbances.

Obviously, NMF is not unique in general case, and it is characterized by a scale and permutation indeterminacies. These problems have been addressed recently by many researchers [39–42], and in this paper, the problems will not be discussed. However, we have shown by extensive computer simulations that in practice with overwhelming probability we are able to achieve a unique nonnegative factorization (neglecting unavoidable scaling and permutation ambiguities) if data are sufficiently sparse and a suitable NMF algorithm is applied [43]. This is consistent with very recent theoretical results [40].

The noise distribution is strongly application-dependent, however, in many BSS applications, a Gaussian noise is expected. Here our considerations are restricted to this case, however, the alternative NMF algorithms optimized to different distributions of the noise exist and can be found, for example, in [37, 44, 45].

NMF was proposed by Paatero and Tapper [46, 47] but Lee and Seung [11, 48] highly popularized this method by using simple multiplicative algorithms to perform NMF. An extensive study on convergence of multiplicative algorithms for NMF can be found in [49]. In general, the multiplicative algorithms are known to be very slowly convergent for large-scale problems. Due to this reason, there is a need to search more efficient and fast algorithms for NMF. Many approaches have been proposed in the literature to relax these problems. One of them is to apply projected gradient (PG) algorithms [50–53] or projected alternating least-squares (ALS) algorithms [33, 54, 55] instead of multiplicative ones. Lin [52] suggested applying the Armijo rule to estimate the learning parameters in projected gradient updates for NMF. The NMF PG algorithms proposed by us in [53] also address the issue with selecting such a learning parameter that is the steepest descent and also keeps some distance to a boundary of the nonnegative orthant (subspace of real nonnegative numbers). Another very robust technique concerns exploiting the information from the second-order Taylor expansion term of a cost function to speed up the convergence. This approach was proposed in [45, 56], where the mixing matrix 𝐀 is updated with the projected Newton method, and the sources in 𝐗 are computed with the projected least-squares method (the fixed point algorithm).

In this paper, we extend our approach to NMF that we have initialized in [53]. We have investigated, extended, and tested several recently proposed PG algorithms such as the oblique projected Landweber [57], Barzilai-Borwein gradient projection [58], projected sequential subspace optimization [59, 60], interior-point Newton [61], and sequential coordinate-wise [62]. All the presented algorithms in this paper are quite efficient for solving large-scale minimization problems subject to nonnegativity and sparsity constraints.

The main objective of this paper is to develop, extend, and/or modify some of the most promising PG algorithms to a standard NMF problem and to find optimal conditions or parameters for such a class of NMF algorithms. The second objective is to compare the performance and complexity of these algorithms for NMF problems, and to discover or establish the most efficient and promising algorithms. We would like to emphasize that most of the discussed algorithms have not been implemented neither used till now or even tested before for NMF problems, but they have been rather considered for solving a standard system of algebraic equations: 𝐀 𝐱 ( 𝑘 ) = 𝐲 ( 𝑘 ) (for only 𝑘 = 1 ) where the matrix 𝐀 and the vectors 𝐲 are known. In this paper, we consider a much more difficult and complicated problem in which we have two sets of parameters and additional constraints of nonnegativity and/or sparsity. So it was not clear till now whether such algorithms would work efficiently for NMF problems, and if so, what kind of projected algorithms is the most efficient? To our best knowledge only the Lin-PG NMF algorithm is widely used and known for NMF problems. We have demonstrated experimentally that there are several novel PG gradient algorithms which are much more efficient and consistent than the Lin-PG algorithm.

In Section 2, we briefly discuss the PG approach to NMF. Section 3 describes the tested algorithms. The experimental results are illustrated in Section 4. Finally, some conclusions are given in Section 5.

2. Projected Gradient Algorithms

In contrast to the multiplicative algorithms, the class of PG algorithms has additive updates. The algorithms discussed here approximately solve nonnegative least squares (NNLS) problems with the basic alternating minimization technique that is used in NMF: m i n 𝐱 𝑡 ≥ 0 𝐷 𝐹 𝐲 𝑡 | | | | 𝐀 𝐱 𝑡 = 1 2 ‖ ‖ 𝐲 𝑡 − 𝐀 𝐱 𝑡 ‖ ‖ 2 2 , 𝑡 = 1 , … , 𝑇 , ( 1 ) m i n 𝐚 𝑖 ≥ 0 𝐷 𝐹 𝐲 𝑖 | | | | 𝐗 𝑇 𝐚 𝑖 = 1 2 ‖ ‖ 𝐲 𝑖 − 𝐗 𝑇 𝐚 𝑖 ‖ ‖ 2 2 , 𝑖 = 1 , … , 𝐼 ( 2 ) or in the equivalent matrix form m i n 𝑥 𝑗 𝑡 ≥ 0 𝐷 𝐹 | | | | 1 ( 𝐘 𝐀 𝐗 ) = 2 ‖ ‖ ‖ ‖ 𝐘 − 𝐀 𝐗 2 𝐹 , ( 3 ) m i n 𝑎 𝑖 𝑗 ≥ 0 𝐷 𝐹 𝐘 𝑇 | | | | 𝐗 𝑇 𝐀 𝑇 = 1 2 ‖ ‖ 𝐘 𝑇 − 𝐗 𝑇 𝐀 𝑇 ‖ ‖ 2 𝐹 , ( 4 ) where 𝐀 = [ 𝐚 1 , … , 𝐚 𝐽 ] ∈ ℝ 𝐼 × 𝐽 , 𝐀 𝑇 = [ 𝐚 1 , … , 𝐚 𝐼 ] ∈ ℝ 𝐽 × 𝐼 , 𝐗 = [ 𝐱 1 , … , 𝐱 𝑇 ] ∈ ℝ 𝐽 × 𝑇 , 𝐗 𝑇 = [ 𝐱 1 , … , 𝐱 𝐽 ] ∈ ℝ 𝑇 × 𝐽 , 𝐘 = [ 𝐲 1 , … , 𝐲 𝑇 ] ∈ ℝ 𝐼 × 𝑇 , 𝐘 𝑇 = [ 𝐲 1 , … , 𝐲 𝐼 ] ∈ ℝ 𝐼 × 𝑇 , and usually 𝐼 ≥ 𝐽 . The matrix 𝐀 is assumed to be a full-rank matrix, so there exists a unique solution 𝐗 ∗ ∈ ℝ 𝐽 × 𝑇 for any matrix 𝐘 since the NNLS problem is strictly convex (with respect to one set of variables { 𝐗 } ).

The solution 𝐱 ∗ 𝑡 to (1) satisfies the Karush-Kuhn-Tucker (KKT) conditions: 𝐱 ∗ 𝑡 ≥ 0 , 𝐠 𝑋 𝐱 ∗ 𝑡 ≥ 0 , 𝐠 𝑋 𝐱 ∗ 𝑡 𝑇 𝐱 ∗ 𝑡 = 0 , ( 5 ) or in the matrix notation 𝐗 ∗ ≥ 0 , 𝐆 𝑋 𝐗 ∗ 𝐆 ≥ 0 , t r 𝑋 𝐗 ∗ 𝑇 𝐗 ∗ = 0 , ( 6 ) where 𝐠 𝑋 and 𝐆 𝑋 are the corresponding gradient vector and gradient matrix: 𝐠 𝑋 𝐱 𝑡 = ∇ 𝐱 𝑡 𝐷 𝐹 𝐲 𝑡 | | | | 𝐀 𝐱 𝑡 = 𝐀 𝑇 𝐀 𝐱 𝑡 − 𝐲 𝑡 𝐆 , ( 7 ) 𝑋 ( 𝐗 ) = ∇ 𝐗 𝐷 𝐹 | | | | ( 𝐘 𝐀 𝐗 ) = 𝐀 𝑇 ( 𝐀 𝐗 − 𝐘 ) . ( 8 )

Similarly, the KKT conditions for the solution 𝐚 ∗ to (2), and the solution 𝐀 ∗ to (4) are as follows: 𝐚 ∗ 𝑖 ≥ 0 , 𝐠 𝐴 𝐚 ∗ 𝑖 ≥ 0 , 𝐠 𝐴 𝐚 ∗ 𝑖 𝑇 𝐚 ∗ 𝑖 = 0 , ( 9 ) or in the matrix notation: 𝐀 ∗ ≥ 0 , 𝐆 𝐴 𝐀 ∗ 𝐀 ≥ 0 , t r ∗ 𝐆 𝐴 𝐀 ∗ 𝑇 = 0 , ( 1 0 ) where 𝐠 𝐴 and 𝐆 𝐴 are the gradient vector and gradient matrix of the objective function: 𝐠 𝐴 𝐚 𝑡 = ∇ 𝐚 𝑖 𝐷 𝐹 𝐲 𝑖 | | | | 𝐗 𝑇 𝐚 𝑖 = 𝐗 𝑇 𝐚 𝑖 − 𝐲 𝑖 , 𝐆 𝐴 ( 𝐀 ) = ∇ 𝐀 𝐷 𝐹 𝐘 𝑇 | | | | 𝐗 𝑇 𝐀 𝑇 = ( 𝐀 𝐗 − 𝐘 ) 𝐗 𝑇 . ( 1 1 )

There are many approaches to solve the problems (1) and (2), or equivalently (3) and (4). In this paper, we discuss selected projected gradient methods that can be generally expressed by iterative updates: 𝐗 ( 𝑘 + 1 ) = 𝑃 Ω 𝐗 ( 𝑘 ) − 𝜂 𝑋 ( 𝑘 ) 𝐏 𝑋 ( 𝑘 ) , 𝐀 ( 𝑘 + 1 ) = 𝑃 Ω 𝐀 ( 𝑘 ) − 𝜂 𝐴 ( 𝑘 ) 𝐏 𝐴 ( 𝑘 ) , ( 1 2 ) where 𝑃 Ω [ 𝜉 ] is a projection of 𝜉 onto a convex feasible set Ω = { 𝜉 ∈ ℝ ∶ 𝜉 ≥ 0 } , namely, the nonnegative orthant ℝ + (the subspace of nonnegative real numbers), 𝐏 𝑋 ( 𝑘 ) and 𝐏 𝐴 ( 𝑘 ) are descent directions for 𝐗 and 𝐀 , and 𝜂 𝑋 ( 𝑘 ) and 𝜂 𝐴 ( 𝑘 ) are learning rules, respectively.

The projection 𝑃 Ω [ 𝜉 ] can be performed in several ways. One of the simplest techniques is to replace all negative entries in 𝜉 by zero-values, or in practical cases, by a small positive number 𝜖 to avoid numerical instabilities. Thus, 𝑃 [ 𝜉 ] = m a x 𝜖 , 𝜉 . ( 1 3 ) However, this is not the only way to carry out the projection 𝑃 Ω ( 𝜉 ) . It is typically more efficient to choose the learning rates 𝜂 𝑋 ( 𝑘 ) and 𝜂 𝐴 ( 𝑘 ) so as to preserve nonnegativity of the solutions. The nonnegativity can be also maintained by solving least-squares problems subject to the constraints (6) and (10). Here we present the exemplary PG methods that work for NMF problems quite efficiently, and we implemented them in the Matlab toolboxm, NMFLAB/NTFLAB, for signal and image processing [43]. For simplicity, we focus our considerations on updating the matrix 𝐗 , assuming that the updates for 𝐀 can be obtained in a similar way. Note that the updates for 𝐀 can be readily obtained solving the transposed system 𝐗 𝑇 𝐀 𝑇 = 𝐘 𝑇 , having 𝐗 fixed (updated in the previous step).

3. Algorithms

3.1. Oblique Projected Landweber Method

The Landweber method [63] performs gradient-descent minimization with the following iterative scheme: 𝐗 ( 𝑘 + 1 ) = 𝐗 ( 𝑘 ) − 𝜂 𝐆 𝑋 ( 𝑘 ) , ( 1 4 ) where the gradient is given by (8), and the learning rate 𝜂 ∈ ( 0 , 𝜂 m a x ) . The updating formula assures an asymptotical convergence to the minimal-norm least squares solution for the convergence radius defined by 𝜂 m a x = 2 𝜆 m a x 𝐀 𝑇 𝐀 , ( 1 5 ) where 𝜆 m a x ( 𝐀 𝑇 𝐀 ) is the maximal eigenvalue of 𝐀 𝑇 𝐀 . Since 𝐀 is a nonnegative matrix, we have 𝜆 m a x ( 𝐀 𝑇 𝐀 ) ≤ m a x 𝑗 [ 𝐀 𝑇 𝐀 𝟏 𝐽 ] 𝑗 , where 𝟏 𝐽 = [ 1 , … , 1 ] 𝑇 ∈ ℝ 𝐽 . Thus the modified Landweber iterations can be expressed by the formula 𝐗 ( 𝑘 + 1 ) = 𝑃 Ω 𝐗 ( 𝑘 ) 𝜂 − d i a g 𝑗 𝐆 𝑋 ( 𝑘 ) , w h e r e 𝜂 𝑗 = 2 𝐀 𝑇 𝐀 𝟏 𝐽 𝑗 . ( 1 6 ) In the obliqueprojected Landweber (OPL) method [57], which can be regarded as a particular case of the PG iterative formula (12), the solution obtained with (14) in each iterative step is projected onto the feasible set. Finally, we have Algorithm 1 for updating 𝐗 .

alg1
Algorithm 1: (OPL).

3.2. Projected Gradient

One of the fundamental PG algorithms for NMF was proposed by Lin in [52]. This algorithm, which we refer to as the Lin-PG, uses the Armijo rule along the projection arc to determine the steplengths 𝜂 𝑋 ( 𝑘 ) and 𝜂 𝐴 ( 𝑘 ) in the iterative updates (12). For the cost function being the squared Euclidean distance, 𝐏 𝑋 = ( 𝐀 ( 𝑘 ) ) 𝑇 ( 𝐀 ( 𝑘 ) 𝐗 ( 𝑘 ) − 𝐘 ) and 𝐏 𝐴 = ( 𝐀 ( 𝑘 ) 𝐗 ( 𝑘 + 1 ) − 𝐘 ) ( 𝐗 ( 𝑘 + 1 ) ) 𝑇 .

For computation of 𝐗 , such a value of 𝜂 𝑋 is decided, on which 𝜂 𝑋 ( 𝑘 ) = 𝛽 𝑚 𝑘 , ( 1 7 ) where 𝑚 𝑘 is the first nonnegative integer 𝑚 that satisfies 𝐷 𝐹 𝐘 | | | | 𝐀 𝐗 ( 𝑘 + 1 ) − 𝐷 𝐹 𝐘 | | | | 𝐀 𝐗 ( 𝑘 ) ≤ 𝜎 ∇ 𝑋 𝐷 𝐹 𝐘 | | | | 𝐀 𝐗 ( 𝑘 ) 𝑇 𝐗 ( 𝑘 + 1 ) − 𝐗 ( 𝑘 ) . ( 1 8 ) The parameters 𝛽 ∈ ( 0 , 1 ) and 𝜎 ∈ ( 0 , 1 ) decide about a convergence speed. In this algorithm we set 𝜎 = 0 . 0 1 , 𝛽 = 0 . 1 experimentally as default.

The Matlab implementation of the Lin-PG algorithm is given in [52].

3.3. Barzilai-Borwein Gradient Projection

The Barzilai-Borwein gradient projection method [58, 64] is motivated by the quasi-Newton approach, that is, the inverse of the Hessian is replaced with an identity matrix 𝐇 𝑘 = 𝛼 𝑘 𝐈 , where the scalar 𝛼 𝑘 is selected so that the inverse Hessian has similar behavior as the true Hessian in the recent iteration. Thus, 𝐗 ( 𝑘 + 1 ) − 𝐗 ( 𝑘 ) ≈ 𝛼 𝑘 ∇ 𝑋 𝐷 𝐘 ‖ ‖ 𝐀 ( 𝑘 ) 𝐗 ( 𝑘 + 1 ) − ∇ 𝑋 𝐷 𝐘 ‖ ‖ 𝐀 ( 𝑘 ) 𝐗 ( 𝑘 ) . ( 1 9 ) In comparison to, for example, Lin's method [52], this method does not ensure that the objective function decreases at every iteration, but its general convergence has been proven analytically [58]. The general scheme of the Barzilai-Borwein gradient projection algorithm for updating 𝐗 is in Algorithm 2.

alg2
Algorithm 2: (GPSR-BB).

Since 𝐷 𝐹 ( 𝐘 | | 𝐀 𝐗 ) is a quadratic function, the line search parameter 𝝀 ( 𝑘 ) can be derived in the following closed-form formula: 𝝀 ( 𝑘 ) Δ = m a x 0 , m i n 1 , d i a g ( 𝑘 ) 𝑇 ∇ 𝑋 𝐷 𝐹 | | | | ( 𝐘 𝐀 𝐗 ) Δ d i a g ( 𝑘 ) 𝑇 𝐀 𝑇 𝐀 Δ ( 𝑘 ) . ( 2 0 )

The Matlab implementation of the GPSR-BB algorithm, which solves the system 𝐀 𝐗 = 𝐘 of multiple measurement vectors subject to nonnegativity constraints, is given in Algorithm 4 (see also NMFLAB).

3.4. Projected Sequential Subspace Optimization

The projected sequential subspace optimization (PSESOP) method [59, 60] carries out a projected minimization of a smooth objective function over a subspace spanned by several directions which include the current gradient and gradient from the previous iterations, and the Nemirovski directions. Nemirovski [65] suggested that convex smooth unconstrained optimization is optimal if the optimization is performed over a subspace which includes the current gradient 𝐠 ( 𝐱 ) , the directions 𝐝 1 ( 𝑘 ) = 𝐱 ( 𝑘 ) − 𝐱 ( 0 ) , and the linear combination of the previous gradients 𝐝 2 ( 𝑘 ) = ∑ 𝑘 − 1 𝑛 = 0 𝑤 𝑛 𝐠 ( 𝐱 𝑛 ) with the coefficients 𝑤 𝑛 , 𝑛 = 0 , … , 𝑘 − 1 . The directions should be orthogonal to the current gradient. Narkiss and Zibulevsky [59] also suggested to include another direction: 𝐩 ( 𝑘 ) = 𝐱 ( 𝑘 ) − 𝐱 ( 𝑘 − 1 ) , which is motivated by a natural extension of the conjugate gradient (CG) method to a nonquadratic case. However, our practical observations showed that this direction does not have a strong impact on the NMF components, thus we neglected it in our NMF-PSESOP algorithm. Finally, we have Algorithm 3 for updating 𝐱 𝑡 which is a single column vector of 𝐗 .

alg3
Algorithm 3: (NMF-PSESOP).

alg5
Algorithm 4

The parameter 𝑝 denotes the number of previous iterates that are taken into account to determine the current update.

The line search vector 𝜶 ∗ ( 𝑘 ) derived in a closed form for the objective function 𝐷 𝐹 ( 𝐲 𝑡 | | 𝐀 𝐱 𝑡 ) is as follows: 𝜶 ∗ ( 𝑘 ) 𝐃 = − ( 𝑘 ) 𝑇 𝐀 𝑇 𝐀 𝐃 ( 𝑘 ) + 𝜆 𝐈 − 1 𝐃 ( 𝑘 ) 𝑇 ∇ 𝐱 𝑡 𝐷 𝐹 𝐲 𝑡 | | | | 𝐀 𝐱 𝑡 . ( 2 1 ) The regularization parameter can be set as a very small constant to avoid instabilities in inverting a rank-deficient matrix in case that 𝐃 ( 𝑘 ) has zero-value or dependent columns.

3.5. Interior Point Newton Algorithm

The interior point Newton (IPN) algorithm [61] solves the NNLS problem (1) by searching the solution satisfying the KKT conditions (5) which equivalently can be expressed by the nonlinear equations 𝐃 𝐱 𝑡 𝐠 𝐱 𝑡 = 0 , ( 2 2 ) where 𝐃 ( 𝐱 𝑡 ) = d i a g { 𝑑 1 ( 𝐱 𝑡 ) , … , 𝑑 𝐽 ( 𝐱 𝑡 ) } , 𝐱 𝑡 ≥ 0 , and 𝑑 𝑗 𝐱 𝑡 = ⎧ ⎪ ⎨ ⎪ ⎩ 𝑥 𝑗 𝑡 i f 𝑔 𝑗 𝐱 𝑡 ≥ 0 , 1 o t h e r w i s e . ( 2 3 ) Applying the Newton method to (22), we have in the 𝑘 th iterative step 𝐃 𝑘 𝐱 𝑡 𝐀 𝑇 𝐀 + 𝐄 𝑘 𝐱 𝑡 𝐩 𝑘 = − 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 , ( 2 4 ) where 𝐄 𝑘 𝐱 𝑡 𝑒 = d i a g 1 𝐱 𝑡 , … , 𝑒 𝐽 𝐱 𝑡 . ( 2 5 ) In [61], the entries of the matrix 𝐄 𝑘 ( 𝐱 𝑡 ) are defined by 𝑒 𝑗 𝐱 𝑡 = ⎧ ⎪ ⎨ ⎪ ⎩ 𝑔 𝑗 𝐱 𝑡 i f 0 ≤ 𝑔 𝑗 𝐱 𝑡 < 𝑥 𝛾 𝑗 𝑡 𝑔 , o r 𝑗 𝐱 𝑡 𝛾 > 𝑥 𝑗 𝑡 , 1 o t h e r w i s e , ( 2 6 ) for 1 < 𝛾 ≤ 2 .

If the solution is degenerate, that is, 𝑡 = 1 , … , 𝑇 , ∃ 𝑗 ∶ 𝑥 ∗ 𝑗 𝑡 = 0 , and 𝑔 𝑗 𝑡 = 0 , the matrix 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐀 𝑇 𝐀 + 𝐄 𝑘 ( 𝐱 𝑡 ) may be singular. To avoid such a case, the system of equations has been rescaled to the following form: 𝐖 𝑘 𝐱 𝑡 𝐃 𝑘 𝐱 𝑡 𝐌 𝑘 𝐱 𝑡 𝐩 𝑘 = − 𝐖 𝑘 𝐱 𝑡 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 ( 2 7 ) with 𝐌 𝑘 𝐱 𝑡 = 𝐀 𝑇 𝐀 + 𝐃 𝑘 𝐱 𝑡 − 1 𝐄 𝑘 𝐱 𝑡 , 𝐖 𝑘 𝐱 𝑡 𝑤 = d i a g 1 𝐱 𝑡 , … , 𝑤 𝐽 𝐱 𝑡 , 𝑤 𝑗 𝐱 𝑡 = 𝑑 𝑗 𝐱 𝑡 + 𝑒 𝑗 𝐱 𝑡 − 1 , ( 2 8 ) for 𝐱 𝑡 > 0 . In [61], the system (27) is solved by the inexact Newton method, which leads to the following updates: 𝐖 𝑘 𝐱 𝑡 𝐃 𝑘 𝐱 𝑡 𝐌 𝑘 𝐱 𝑡 𝐩 𝑘 = − 𝐖 𝑘 𝐱 𝑡 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 + 𝐫 𝑘 𝐱 𝑡 ̂ 𝐩 , ( 2 9 ) 𝑘 ‖ ‖ 𝑃 = m a x 𝜎 , 1 − Ω 𝐱 𝑡 ( 𝑘 ) + 𝐩 𝑘 − 𝐱 𝑡 ( 𝑘 ) ‖ ‖ 2 𝑃 Ω 𝐱 𝑡 ( 𝑘 ) + 𝐩 𝑘 − 𝐱 𝑡 ( 𝑘 ) 𝐱 , ( 3 0 ) 𝑡 ( 𝑘 + 1 ) = 𝐱 𝑡 ( 𝑘 ) + ̂ 𝐩 𝑘 , ( 3 1 ) where 𝜎 ∈ ( 0 , 1 ) , 𝐫 𝑘 ( 𝐱 𝑡 ) = 𝐀 𝑇 ( 𝐀 𝐱 𝑡 − 𝐲 𝑡 ) , and 𝑃 Ω [ ⋅ ] is a projection onto a feasible set Ω .

The transformation of the normal matrix 𝐀 𝑇 𝐀 by the matrix 𝐖 𝑘 ( 𝐱 𝑡 ) 𝐃 𝑘 ( 𝐱 𝑡 ) in (27) means the system matrix 𝐖 𝑘 ( 𝐱 𝑡 ) 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐌 𝑘 ( 𝐱 𝑡 ) is no longer symmetric and positive-definite. There are many methods for handling such systems of linear equations, like QMR [66], BiCG [67, 68], BiCGSTAB [69], or GMRES-like methods [70], however, they are more complicated and computationally demanding than, for example, the basic CG algorithm [71]. To apply the CG algorithm the system matrix in (27) must be converted to a positive-definite symmetric matrix, which can be easily done with normal equations. The methods like CGLS [72] or LSQR [73] are therefore suitable for such tasks. The transformed system has the form 𝐙 𝑘 𝐱 𝑡 𝐩 𝑘 = − 𝐒 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 + 𝐫 𝑘 𝐱 𝑡 𝐒 , ( 3 2 ) 𝑘 𝐱 𝑡 = 𝐖 𝑘 𝐱 𝑡 𝐃 𝑘 𝐱 𝑡 , 𝐙 ( 3 3 ) 𝑘 𝐱 𝑡 = 𝐒 𝑘 𝐱 𝑡 𝐌 𝑘 𝐱 𝑡 𝐒 𝑘 𝐱 𝑡 = 𝐒 𝑘 𝐱 𝑡 𝐀 𝑇 𝐀 𝐒 𝑘 𝐱 𝑡 + 𝐖 𝑘 𝐱 𝑡 𝐄 𝑘 𝐱 𝑡 , ( 3 4 ) with 𝐩 𝑘 = 𝐒 𝑘 − 1 ( 𝐱 𝑡 ) 𝐩 𝑘 and 𝐫 𝑘 = 𝐒 𝑘 − 1 ( 𝐱 𝑡 ) 𝐫 𝑘 ( 𝐱 𝑡 ) .

Since our cost function is quadratic, its minimization in a single step is performed with combining the projected Newton step with the constrained scaled Cauchy step that is given in the form 𝐩 𝑘 ( 𝐶 ) = − 𝜏 𝑘 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 , 𝜏 𝑘 > 0 . ( 3 5 ) Assuming 𝐱 𝑡 ( 𝑘 ) + 𝐩 𝑘 ( 𝐶 ) > 0 , 𝜏 𝑘 is chosen as being either the unconstrained minimizer of the quadratic function 𝜓 𝑘 ( − 𝜏 𝑘 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) ) or a scalar proportional to the distance to the boundary along − 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) , where 𝜓 𝑘 1 ( 𝐩 ) = 2 𝐩 𝑇 𝐌 𝑘 𝐱 𝑡 𝐩 + 𝐩 𝑇 𝐠 𝑘 𝐱 𝑡 = 1 2 𝐩 𝑇 𝐀 𝑇 𝐀 + 𝐃 𝑘 − 1 𝐱 𝑡 𝐄 𝑘 𝐱 𝑡 𝐩 + 𝐩 𝑇 𝐀 𝑇 𝐀 𝐱 𝑡 ( 𝑘 ) − 𝐲 𝑡 . ( 3 6 ) Thus 𝜏 𝑘 = ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ 𝜏 1 = a r g m i n 𝜏 𝜓 𝑘 − 𝜏 𝑘 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 i f 𝐱 𝑡 ( 𝑘 ) − 𝜏 1 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 𝜏 > 0 , 2 = 𝜃 m i n 𝑗 𝑥 ( 𝑘 ) 𝑗 𝑡 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 𝑗 ∶ 𝐃 𝑘 𝐱 𝑡 𝐠 𝑘 𝐱 𝑡 𝑗 > 0 o t h e r w i s e , ( 3 7 ) where 𝜓 𝑘 ( − 𝜏 𝑘 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) ) = ( 𝐠 𝑘 ( 𝐱 𝑡 ) ) 𝑇 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) / ( 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) ) 𝑇 𝐌 𝑘 ( 𝐱 𝑡 ) 𝐃 𝑘 ( 𝐱 𝑡 ) 𝐠 𝑘 ( 𝐱 𝑡 ) with 𝜃 ∈ ( 0 , 1 ) . For 𝜓 𝑘 ( 𝐩 𝑘 ( 𝐶 ) ) < 0 , the global convergence is achieved if r e d ( 𝐱 𝑡 ( 𝑘 + 1 ) − 𝐱 𝑡 ( 𝑘 ) ) ≥ 𝛽 , 𝛽 ∈ ( 0 , 1 ) with 𝜓 r e d ( 𝐩 ) = 𝑘 ( 𝐩 ) 𝜓 𝑘 𝐩 𝑘 ( 𝐶 ) . ( 3 8 )

The usage of the constrained scaled Cauchy step leads to the following updates: 𝐬 𝑡 ( 𝑘 ) 𝐩 = 𝑡 𝑘 ( 𝐶 ) − ̂ 𝐩 𝑘 + ̂ 𝐩 𝑘 , 𝐱 𝑡 ( 𝑘 + 1 ) = 𝐱 𝑡 ( 𝑘 ) + 𝐬 𝑡 ( 𝑘 ) , ( 3 9 ) with 𝑡 ∈ [ 0 , 1 ) , ̂ 𝐩 𝑘 and 𝐩 𝑘 ( 𝐶 ) are given by (30) and (35), respectively, and 𝑡 is the smaller square root (laying in ( 0 , 1 ) ) of the quadratic equation: 𝜋 ( 𝑡 ) = 𝜓 𝑘 𝑡 𝐩 𝑘 ( 𝐶 ) − ̂ 𝐩 𝑘 + ̂ 𝐩 𝑘 − 𝛽 𝜓 𝑘 𝐩 𝑘 ( 𝐶 ) = 0 . ( 4 0 )

The Matlab code of the IPN algorithm, which solves the system 𝐀 𝐱 𝑡 = 𝐲 𝑡 subject to nonnegativity constraints, is given in Algorithm 5. To solve the transformed system (32), we use the LSQR method implemented in Matlab 7.0.

alg6
Algorithm 5

3.6. Sequential Coordinate-Wise Algorithm

The NNLS problem (1) can be expressed in terms of the following quadratic problem (QP) [62]: m i n 𝐱 𝑡 ≥ 0 Ψ 𝐱 𝑡 , ( 𝑡 = 1 , … , 𝑇 ) , ( 4 1 ) where Ψ 𝐱 𝑡 = 1 2 𝐱 𝑇 𝑡 𝐇 𝐱 𝑡 + 𝐜 𝑇 𝑡 𝐱 𝑡 , ( 4 2 ) with 𝐇 = 𝐀 𝑇 𝐀 and 𝐜 𝑡 = − 𝐀 𝑇 𝐲 𝑡 .

The sequential coordinate-wise algorithm (SCWA) proposed first by Franc et al. [62] solves the QP problem given by (41) updating only single variable 𝑥 𝑗 𝑡 in one iterative step. It should be noted that the sequential updates can be easily done, if the function Ψ ( 𝐱 𝑡 ) is equivalently rewritten as Ψ 𝐱 𝑡 = 1 2 𝑝 ∈ ℐ 𝑟 ∈ ℐ 𝑥 𝑝 𝑡 𝑥 𝑟 𝑡 𝐀 𝑇 𝐀 𝑝 𝑟 + 𝑝 ∈ ℐ 𝑥 𝑝 𝑡 𝐀 𝑇 𝐲 𝑡 𝑝 𝑡 = 1 2 𝑥 2 𝑗 𝑡 𝐀 𝑇 𝐀 𝑗 𝑗 + 𝑥 𝑗 𝑡 𝐀 𝑇 𝐲 𝑡 𝑗 𝑡 + 𝑥 𝑗 𝑡 𝑝 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝐀 𝑇 𝐀 𝑝 𝑗 + 𝑝 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝐀 𝑇 𝐲 𝑡 𝑝 𝑡 + 1 2 𝑝 ∈ ℐ ⧵ 𝑗 𝑟 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝑥 𝑟 𝑡 𝐀 𝑇 𝐀 𝑝 𝑟 = 1 2 𝑥 2 𝑗 𝑡 ℎ 𝑗 𝑗 + 𝑥 𝑗 𝑡 𝛽 𝑗 𝑡 + 𝛾 𝑗 𝑡 , ( 4 3 ) where ℐ = { 1 , … , 𝐽 } , and

ℎ 𝑗 𝑗 = 𝐀 𝑇 𝐀 𝑗 𝑗 , 𝛽 𝑗 𝑡 = 𝐀 𝑇 𝐲 𝑡 𝑗 𝑡 + 𝑝 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝐀 𝑇 𝐀 𝑝 𝑗 = 𝐀 𝑇 𝐀 𝐱 𝑡 + 𝐀 𝑇 𝐲 𝑡 𝑗 𝑡 − 𝐀 𝑇 𝐀 𝑗 𝑗 𝑥 𝑗 𝑡 , 𝛾 𝑗 𝑡 = 𝑝 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝐀 𝑇 𝐲 𝑡 𝑝 𝑡 + 1 2 𝑝 ∈ ℐ ⧵ 𝑗 𝑟 ∈ ℐ ⧵ 𝑗 𝑥 𝑝 𝑡 𝑥 𝑟 𝑡 𝐀 𝑇 𝐀 𝑝 𝑟 . ( 4 4 ) Considering the optimization of Ψ ( 𝐱 𝑡 ) with respect to the selected variable 𝑥 𝑗 𝑡 , the following analytical solution can be derived: 𝑥 ∗ 𝑗 𝑡 𝑥 = a r g m i n Ψ 1 𝑡 , … , 𝑥 𝑗 𝑡 , … , 𝑥 𝐽 𝑡 𝑇 1 = a r g m i n 2 𝑥 2 𝑗 𝑡 ℎ 𝑗 𝑗 + 𝑥 𝑗 𝑡 𝛽 𝑗 𝑡 + 𝛾 𝑗 𝑡 𝛽 = m a x 0 , − 𝑗 𝑡 ℎ 𝑗 𝑗 = m a x 0 , 𝑥 𝑗 𝑡 − 𝐀 𝑇 𝐀 𝐱 𝑡 𝑗 𝑡 + 𝐀 𝑇 𝐲 𝑡 𝑗 𝑡 𝐀 𝑇 𝐀 𝑗 𝑗 . ( 4 5 )

Updating only single variable 𝑥 𝑗 𝑡 in one iterative step, we have 𝑥 ( 𝑘 + 1 ) 𝑝 𝑡 = 𝑥 ( 𝑘 ) 𝑝 𝑡 , ∀ 𝑝 ∈ ℐ ⧵ { 𝑗 } , 𝑥 ( 𝑘 + 1 ) 𝑗 𝑡 ≠ 𝑥 ( 𝑘 ) 𝑗 𝑡 . ( 4 6 ) Any optimal solution to the QP (41) satisfies the KKT conditions given by (5) and the stationarity condition of the following Lagrange function: ℒ 𝐱 𝑡 , 𝝀 𝑡 = 1 2 𝐱 𝑇 𝑡 𝐇 𝐱 𝑡 + 𝐜 𝑇 𝑡 𝐱 𝑡 − 𝝀 𝑇 𝑡 𝐱 𝑡 , ( 4 7 ) where 𝝀 𝑡 ∈ ℝ 𝐽 is a vector of Lagrange multipliers (or dual variables) corresponding to the vector 𝐱 𝑡 . Thus, ∇ 𝐱 𝑡 ℒ ( 𝐱 𝑡 , 𝝀 𝑡 ) = 𝐇 𝐱 𝑡 + 𝐜 𝑡 − 𝝀 𝑡 = 𝟎 . In the SCWA, the Lagrange multipliers are updated in each iteration according to the formula 𝝀 𝑡 ( 𝑘 + 1 ) = 𝝀 𝑡 ( 𝑘 ) + 𝑥 ( 𝑘 + 1 ) 𝑗 𝑡 − 𝑥 ( 𝑘 ) 𝑗 𝑡 𝐡 𝑗 , ( 4 8 ) where 𝐡 𝑗 is the 𝑗 th column of 𝐇 , and 𝝀 𝑡 ( 0 ) = 𝐜 𝑡 .

Finally, the SCWA can take the following updates: 𝑥 ( 𝑘 + 1 ) 𝑗 𝑡 = m a x 0 , 𝑥 ( 𝑘 ) 𝑗 𝑡 − 𝜆 𝑗 ( 𝑘 ) 𝐀 𝑇 𝐀 𝑗 𝑗 , 𝑥 ( 𝑘 + 1 ) 𝑝 𝑡 = 𝑥 ( 𝑘 ) 𝑝 𝑡 𝝀 , ∀ 𝑝 ∈ ℐ ⧵ { 𝑗 } 𝑡 ( 𝑘 + 1 ) = 𝝀 𝑡 ( 𝑘 ) + 𝑥 ( 𝑘 + 1 ) 𝑗 𝑡 − 𝑥 ( 𝑘 ) 𝑗 𝑡 𝐡 𝑗 . ( 4 9 )

4. Simulations

All the proposed algorithms were implemented in our NMFLAB, and evaluated with the numerical tests related to typical BSS problems. We used the synthetic benchmark of 4 partially dependent nonnegative signals (with only 𝑇 = 1 0 0 0 samples) which are illustrated in Figure 1(a). The signals are mixed by random, uniformly distributed nonnegative matrix 𝐀 ∈ ℝ 8 × 4 with the condition number c o n d { 𝐀 } = 4 . 1 1 . The matrix 𝐀 is displayed in ⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦ 𝐀 = 0 . 0 6 3 1 0 . 7 6 6 6 0 . 0 1 7 4 0 . 6 5 9 6 0 . 2 6 4 2 0 . 6 6 6 1 0 . 8 1 9 4 0 . 2 1 4 1 0 . 9 9 9 5 0 . 1 3 0 9 0 . 6 2 1 1 0 . 6 0 2 1 0 . 2 1 2 0 0 . 0 9 5 4 0 . 5 6 0 2 0 . 6 0 4 9 0 . 4 9 8 4 0 . 0 1 4 9 0 . 2 4 4 0 0 . 6 5 9 5 0 . 2 9 0 5 0 . 2 8 8 2 0 . 8 2 2 0 0 . 1 8 3 4 0 . 6 7 2 8 0 . 8 1 6 7 0 . 2 6 3 2 0 . 6 3 6 5 0 . 9 5 8 0 0 . 9 8 5 5 0 . 7 5 3 6 0 . 1 7 0 3 . ( 5 0 ) The mixing signals are shown in Figure 1(b).

fig1
Figure 1: Dataset: (a) original 4 source signals, (b) observed 8 mixed signals.

Because the number of variables in 𝐗 is much greater than in 𝐀 , that is, 𝐼 × 𝐽 = 3 2 and 𝐽 × 𝑇 = 4 0 0 0 , we test the projected gradient algorithms only for updating 𝐀 . The variables in 𝐗 are updated with the standard projected fixed point alternating least squares (FP-ALS) algorithm that is extensively analyzed in [55].

In general, the FP-ALS algorithm solves the least-squares problem 𝐗 ∗ = a r g m i n 𝐗 1 2 ‖ ‖ ‖ ‖ 𝐘 − 𝐀 𝐗 2 𝐹 ( 5 1 ) with the Moore-Penrose pseudoinverse of a system matrix, that is, in our case, the matrix 𝐀 . Since in NMF usually 𝐼 ≥ 𝐽 , we formulate normal equations as 𝐀 𝑇 𝐀 𝐗 = 𝐀 𝑇 𝐘 , and the least-squares solution of minimal 𝑙 2 -norm to the normal equations is 𝐗 L S = ( 𝐀 𝑇 𝐀 ) − 1 𝐀 𝑇 𝐘 = 𝐀 + 𝐘 , where 𝐀 + is the Moore-Penrose pseudoinverse of 𝐀 . The projected FP-ALS algorithm is obtained with a simple “half-rectified” projection, that is, 𝐗 = 𝑃 Ω 𝐀 + 𝐘 . ( 5 2 )

The alternating minimization is nonconvex in spite of the cost function being convex with respect to one set of variables. Thus, most NMF algorithms may get stuck in local minima, and hence, the initialization plays a key role. In the performed tests, we applied the multistart initialization described in [53] with the following parameters: 𝑁 = 1 0 (number of restarts), 𝐾 𝑖 = 3 0 (number of initial alternating steps), and 𝐾 𝑓 = 1 0 0 0 (number of final alternating steps). Each initial sample of 𝐀 and 𝐗 has been randomly generated from a uniform distribution. Each algorithm has been tested for two cases of inner iterations, that is, with 𝑘 = 1 and 𝑘 = 5 . The inner iterations mean a number of iterative steps that are performed to update only 𝐀 (with fixed 𝐗 , i.e., before going to the update of 𝐗 and vice versa). Additionally, the multilayer technique [53, 54] with 3 layers ( 𝐿 = 3 ) is applied.

The multilayer technique can be regarded as multistep decomposition. In the first step, we perform the basic decomposition 𝐘 = 𝐀 1 𝐗 1 using any available NMF algorithm, where 𝐀 1 ∈ ℝ 𝐼 × 𝐽 and 𝐗 1 ∈ ℝ 𝐽 × 𝑇 with 𝐼 ≥ 𝐽 . In the second stage, the results obtained from the first stage are used to perform the similar decomposition: 𝐗 1 = 𝐀 2 𝐗 2 , where 𝐀 2 ∈ ℝ 𝐽 × 𝐽 and 𝐗 2 ∈ ℝ 𝐽 × 𝑇 , using the same or different update rules, and so on. We continue our decomposition taking into account only the last achieved components. The process can be repeated arbitrary many times until some stopping criteria are satisfied. In each step, we usually obtain gradual improvements of the performance. Thus, our model has the form 𝐘 = 𝐀 1 𝐀 2 ⋯ 𝐀 𝐿 𝐗 𝐿 with the basis matrix defined as 𝐀 = 𝐀 1 𝐀 2 ⋯ 𝐀 𝐿 ∈ ℝ 𝐼 × 𝐽 . Physically, this means that we build up a system that has many layers or cascade connection of 𝐿 mixing subsystems.

There are many stopping criteria for terminating the alternating steps. We stop the iterations if 𝑠 ≥ 𝐾 𝑓 = 1 0 0 0 or the following condition ‖ 𝐀 ( 𝑠 ) − 𝐀 ( 𝑠 − 1 ) ‖ 𝐹 < 𝜖 is held, where 𝑠 stands for the number of alternating step, and 𝜖 = 1 0 − 5 . Note that the condition (20) can be also used as a stopping criterion, especially as the gradient is computed in each iteration of the PG algorithms.

The algorithms have been evaluated with the signal-to-interference ratio (SIR) measures, calculated separately for each source signal and each column in the mixing matrix. Since NMF suffers from scale and permutation indeterminacies, the estimated components are adequately permuted and rescaled. First, the source and estimated signals are normalized to a uniform variance, and then the estimated signals are permuted to keep the same order as the source signals. In NMFLAB [43], each estimated signal is compared to each source signal, which results in the performance (SIR) matrix that is involved to make the permutation matrix. Let 𝐱 𝑗 and ̂ 𝐱 𝑗 be the 𝑗 th source and its corresponding (reordered) estimated signal, respectively. Analogically, let 𝐚 𝑗 and ̂ 𝐚 𝑗 be the 𝑗 th column of the true and its corresponding estimated mixing matrix, respectively. Thus, the SIRs for the sources are given by S I R 𝑗 ( 𝑋 ) ‖ ‖ ̂ 𝐱 = − 2 0 l o g 𝑗 − 𝐱 𝑗 ‖ ‖ 2 ‖ ‖ 𝐱 𝑗 ‖ ‖ 2 , 𝑗 = 1 , … , 𝐽 , [ d B ] ( 5 3 ) and similarly for each column in 𝐀 we have S I R 𝑗 ( 𝐴 ) ‖ ‖ ̂ 𝐚 = − 2 0 l o g 𝑗 − 𝐚 𝑗 ‖ ‖ 2 ‖ ‖ 𝐚 𝑗 ‖ ‖ 2 , 𝑗 = 1 , … , 𝐽 , [ d B ] . ( 5 4 )

We test the algorithms with the Monte Carlo (MC) analysis, running each algorithm 100 times. Each run has been initialized with the multistart procedure. The algorithms have been evaluated with the mean-SIR values that are calculated as follows: S I R 𝑋 = 1 𝐽 𝐽 𝑗 = 1 S I R 𝑗 ( 𝑋 ) , S I R 𝐴 = 1 𝐽 𝐽 𝑗 = 1 S I R 𝑗 ( 𝐴 ) , ( 5 5 ) for each MC sample. The mean-SIRs for the worst (with the lowest mean-SIR values) and best (with the highest mean-SIR values) samples are given in Table 1. The number 𝑘 means the number of inner iterations for updating 𝐀 , and 𝐿 denotes the number of layers in the multilayer technique [53, 54]. The notation 𝐿 = 1 means that the multilayer technique was not used. The elapsed time [in seconds] is measured in Matlab, and it informs us in some sense about a degree of complexity of the algorithm.

tab1
Table 1: Mean-SIRs [dB] obtained with 100 samples of Monte Carlo analysis for the estimation of sources and columns of mixing matrix from noise-free mixtures of signals in Figure 1. Sources 𝐗 are estimated with the projected pseudoinverse. The number of inner iterations for updating 𝐀 is denoted by 𝑘 , and the number of layers (in the multilayer technique) by 𝐿 . The notation best or worst in parenthesis that follows the algorithm name means that the mean-SIR value is calculated for the best or worst sample from Monte Carlo analysis, respectively. In the last column, the elapsed time [in seconds] is given for each algorithm with 𝑘 = 1 and 𝐿 = 1 .

For comparison, Table 1 contains also the results obtained for the standard multiplicative NMF algorithm (denoted as M-NMF) that minimizes the squared Euclidean distance. Additionally, the results of testing the PG algorithms which were proposed in [53] have been also included. The acronyms Lin-PG, IPG, RMRNSD refer to the following algorithms: projected gradient proposed by Lin [52], interior-point gradient, and regularized minimal residual norm steepest descent (the regularized version of the MRNSD algorithm that was proposed by Nagy and Strakos [74]). These NMF algorithms have been implemented and investigated in [53] in the context of their usefulness to BSS problems.

5. Conclusions

The performance of the proposed NMF algorithms can be inferred from the results given in Table 1. In particular, the results show how the algorithms are sensitive to initialization, or in other words, how easily they fall in local minima. Also the complexity of the algorithms can be estimated from the information on the elapsed time that is measured in Matlab.

It is easy to notice that our NMF-PSESOP algorithm gives the best estimation (the sample which has the highest best-SIR value), and it gives only slightly lower mean-SIR values than the Lin-PG algorithm. Considering the elapsed time, the PL, GPSR-BB, SCWA, and IPG belong to the fastest algorithms, while the Lin-PG and IPN algorithms are the slowest.

The multilayer technique generally improves the performance and consistency of all the tested algorithms if the number of observation is close to the number of nonnegative components. The highest improvement can be observed for the NMF-PSESOP algorithm, especially when the number of inner iterations is greater than one (typically, 𝑘 = 5 ).

In summary, the best and the most promising NMG-PG algorithms are NMF-PSESOP, GPSR-BB, and IPG algorithms. However, the final selection of the algorithm depends on a size of the problem to be solved. Nevertheless, the projected gradient NMF algorithms seem to be much better (in the sense of speed and performance) in our tests than the multiplicative algorithms, provided that we can use the squared Euclidean cost function which is optimal for data with a Gaussian noise.

References

  1. A. Cichocki, R. Zdunek, and S. Amari, “New algorithms for nonnegative matrix factorization in applications to blind source separation,” in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '06), vol. 5, pp. 621–624, Toulouse, France, May 2006. View at Publisher · View at Google Scholar
  2. J. Piper, V. P. Pauca, R. J. Plemmons, and M. Giffin, “Object characterization from spectral data using nonnegative matrix factorization and information theory,” in Proceedings of the AMOS Technical Conference, pp. 1–12, Maui, Hawaii, USA, September 2004.
  3. M. N. Schmidt and M. Mørup, “Nonnegative matrix factor 2-D deconvolution for blind single channel source separation,” in Proceedings of the 6th International Conference on Independent Component Analysis and Blind Signal Separation (ICA '06), vol. 3889 of Lecture Notes in Computer Science, pp. 700–707, Charleston, SC, USA, March 2006. View at Publisher · View at Google Scholar
  4. A. Ziehe, P. Laskov, K. Pawelzik, and K.-R. Mueller, “Nonnegative sparse coding for general blind source separation,” in Advances in Neural Information Processing Systems 16, Vancouver, Canada, 2003.
  5. W. Wang, Y. Luo, J. A. Chambers, and S. Sanei, “Nonnegative matrix factorization for note onset detection of audio signals,” in Proceedings of the 16th IEEE International Workshop on Machine Learning for Signal Processing (MLSP '06), pp. 447–452, Maynooth, Ireland, September 2006. View at Publisher · View at Google Scholar
  6. W. Wang, “Squared euclidean distance based convolutive nonnegative matrix factorization with multiplicative learning rules for audio pattern separation,” in Proceedings of the 7th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT '07), pp. 347–352, Cairo, Egypt, December 2007. View at Publisher · View at Google Scholar
  7. H. Li, T. Adali, W. Wang, and D. Emge, “Nonnegative matrix factorization with orthogonality constraints for chemical agent detection in Raman spectra,” in Proceedings of the 15th IEEE International Workshop on Machine Learning for Signal Processing (MLSP '05), pp. 253–258, Mystic, Conn, USA, September 2005. View at Publisher · View at Google Scholar
  8. P. Sajda, S. Du, T. Brown, L. Parra, and R. Stoyanova, “Recovery of constituent spectra in 3D chemical shift imaging using nonnegative matrix factorization,” in Proceedings of the 4th International Symposium on Independent Component Analysis and Blind (ICA '03), pp. 71–76, Nara, Japan, April 2003.
  9. P. Sajda, S. Du, T. R. Brown, et al., “Nonnegative matrix factorization for rapid recovery of constituent spectra in magnetic resonance chemical shift imaging of the brain,” IEEE Transactions on Medical Imaging, vol. 23, no. 12, pp. 1453–1465, 2004. View at Publisher · View at Google Scholar · View at PubMed
  10. P. Sajda, S. Du, and L. C. Parra, “Recovery of constituent spectra using nonnegative matrix factorization,” in Wavelets: Applications in Signal and Image Processing X, vol. 5207 of Proceedings of SPIE, pp. 321–331, San Diego, Calif, USA, August 2003. View at Publisher · View at Google Scholar
  11. D. D. Lee and H. S. Seung, “Learning the parts of objects by nonnegative matrix factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999. View at Publisher · View at Google Scholar · View at PubMed
  12. W. Liu and N. Zheng, “Nonnegative matrix factorization based methods for object recognition,” Pattern Recognition Letters, vol. 25, no. 8, pp. 893–897, 2004. View at Publisher · View at Google Scholar
  13. M. W. Spratling, “Learning image components for object recognition,” Journal of Machine Learning Research, vol. 7, pp. 793–815, 2006.
  14. Y. Wang, Y. Jia, C. Hu, and M. Turk, “Nonnegative matrix factorization framework for face recognition,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 19, no. 4, pp. 495–511, 2005. View at Publisher · View at Google Scholar
  15. P. Smaragdis, “Nonnegative matrix factor deconvolution; extraction of multiple sound sources from monophonic inputs,” in Proceedings of the 5th International Conference on Independent Component Analysis and Blind Signal Separation (ICA '04), vol. 3195 of Lecture Notes in Computer Science, pp. 494–499, Granada, Spain, September 2004. View at Publisher · View at Google Scholar
  16. P. Smaragdis, “Convolutive speech bases and their application to supervised speech separation,” IEEE Transactions on Audio, Speech and Language Processing, vol. 15, no. 1, pp. 1–12, 2007. View at Publisher · View at Google Scholar
  17. J.-H. Ahn, S. Kim, J.-H. Oh, and S. Choi, “Multiple nonnegative-matrix factorization of dynamic PET images,” in Proceedings of the 6th Asian Conference on Computer Vision (ACCV '04), pp. 1009–1013, Jeju Island, Korea, January 2004.
  18. P. Carmona-Saez, R. D. Pascual-Marqui, F. Tirado, J. M. Carazo, and A. Pascual-Montano, “Biclustering of gene expression data by non-smooth nonnegative matrix factorization,” BMC Bioinformatics, vol. 7, article 78, pp. 1–18, 2006. View at Publisher · View at Google Scholar · View at PubMed
  19. D. Guillamet, B. Schiele, and J. Vitrià, “Analyzing nonnegative matrix factorization for image classification,” in Proceedings of the 16th International Conference on Pattern Recognition (ICPR '02), vol. 2, pp. 116–119, Quebec City, Canada, August 2002. View at Publisher · View at Google Scholar
  20. D. Guillamet and J. Vitrià, “Nonnegative matrix factorization for face recognition,” in Proceedings of the 5th Catalan Conference on Artificial Intelligence (CCIA '02), pp. 336–344, Castello de la Plana, Spain, October 2002.
  21. D. Guillamet, J. Vitrià, and B. Schiele, “Introducing a weighted nonnegative matrix factorization for image classification,” Pattern Recognition Letters, vol. 24, no. 14, pp. 2447–2454, 2003. View at Publisher · View at Google Scholar
  22. O. G. Okun, “Nonnegative matrix factorization and classifiers: experimental study,” in Proceedings of the 4th IASTED International Conference on Visualization, Imaging, and Image Processing (VIIP '04), pp. 550–555, Marbella, Spain, September 2004.
  23. O. G. Okun and H. Priisalu, “Fast nonnegative matrix factorization and its application for protein fold recognition,” EURASIP Journal on Applied Signal Processing, vol. 2006, Article ID 71817, 8 pages, 2006. View at Publisher · View at Google Scholar
  24. A. Pascual-Montano, J. M. Carazo, K. Kochi, D. Lehmann, and R. D. Pascual-Marqui, “Non-smooth nonnegative matrix factorization (nsNMF),” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 403–415, 2006. View at Publisher · View at Google Scholar · View at PubMed
  25. V. P. Pauca, F. Shahnaz, M. W. Berry, and R. J. Plemmons, “Text mining using nonnegative matrix factorizations,” in Proceedings of the 4th SIAM International Conference on Data Mining (SDM '04), pp. 452–456, Lake Buena Vista, Fla, USA, April 2004.
  26. F. Shahnaz, M. W. Berry, V. P. Pauca, and R. J. Plemmons, “Document clustering using nonnegative matrix factorization,” Journal on Information Processing & Management, vol. 42, no. 2, pp. 373–386, 2006. View at Publisher · View at Google Scholar
  27. T. Li and C. Ding, “The relationships among various nonnegative matrix factorization methods for clustering,” in Proceedings of the 6th IEEE International Conference on Data Mining (ICDM '06), pp. 362–371, Hong Kong, December 2006. View at Publisher · View at Google Scholar
  28. C. Ding, T. Li, W. Peng, and H. Park, “Orthogonal nonnegative matrix tri-factorizations for clustering,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), pp. 126–135, Philadelphia, Pa, USA, August 2006.
  29. R. Zass and A. Shashua, “A unifying approach to hard and probabilistic clustering,” in Proceedings of the 10th IEEE International Conference on Computer Vision (ICCV '05), vol. 1, pp. 294–301, Beijing, China, October 2005. View at Publisher · View at Google Scholar
  30. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, “Clustering with Bregman divergences,” in Proceedings of the 4th SIAM International Conference on Data Mining (SDM '04), pp. 234–245, Lake Buena Vista, Fla, USA, April 2004.
  31. H. Cho, I. S. Dhillon, Y. Guan, and S. Sra, “Minimum sum-squared residue co-clustering of gene expression data,” in Proceedings of the 4th SIAM International Conference on Data Mining (SDM '04), pp. 114–125, Lake Buena Vista, Fla, USA, April 2004.
  32. S. Wild, Seeding nonnegative matrix factorization with the spherical k-means clustering, M.S. thesis, University of Colorado, Boulder, Colo, USA, 2000.
  33. M. W. Berry, M. Browne, A. N. Langville, V. P. Pauca, and R. J. Plemmons, “Algorithms and applications for approximate nonnegative matrix factorization,” Computational Statistics and Data Analysis, vol. 52, no. 1, pp. 155–173, 2007. View at Publisher · View at Google Scholar
  34. Y.-C. Cho and S. Choi, “Nonnegative features of spectro-temporal sounds for classification,” Pattern Recognition Letters, vol. 26, no. 9, pp. 1327–1336, 2005. View at Publisher · View at Google Scholar
  35. J.-P. Brunet, P. Tamayo, T. R. Golub, and J. P. Mesirov, “Metagenes and molecular pattern discovery using matrix factorization,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 12, pp. 4164–4169, 2004. View at Publisher · View at Google Scholar · View at PubMed
  36. N. Rao and S. J. Shepherd, “Extracting characteristic patterns from genome-wide expression data by nonnegative matrix factorization,” in Proceedings of the IEEE Computational Systems Bioinformatics Conference (CSB '04), pp. 570–571, Stanford, Calif, USA, August 2004. View at Publisher · View at Google Scholar
  37. A. Cichocki, R. Zdunek, and S. Amari, “Csiszár's divergences for nonnegative matrix factorization: family of new algorithms,” in Independent Component Analysis and Blind Signal Separation, vol. 3889 of Lecture Notes in Computer Science, pp. 32–39, Springer, New York, NY, USA, 2006. View at Publisher · View at Google Scholar
  38. A. Cichocki, R. Zdunek, and S. Amari, “Nonnegative matrix and tensor factorization,” IEEE Signal Processing Magazine, vol. 25, no. 1, pp. 142–145, 2008. View at Publisher · View at Google Scholar
  39. D. Donoho and V. Stodden, “When does nonnegative matrix factorization give a correct decomposition into parts?,” in Advances in Neural Information Processing Systems 16, Vancouver, Canada, 2003.
  40. A. M. Bruckstein, M. Elad, and M. Zibulevsky, “Sparse nonnegative solution of a linear system of equations is unique,” in Proceedings of the 3rd International Symposium on Communications, Control and Signal Processing (ISCCSP '08), St. Julians, Malta, March 2008.
  41. F. J. Theis, K. Stadlthanner, and T. Tanaka, “First results on uniqueness of sparse nonnegative matrix factorization,” in Proceedings of the 13th European Signal Processing Conference (EUSIPCO '05), Antalya, Turkey, September 2005.
  42. H. Laurberg, M. G. Christensen, M. D. Plumbley, L. K. Hansen, and S. H. Jensen, “Theorems on positive data: on the uniqueness of NMF,” Computational Intelligence and Neuroscience, vol. 2008, Article ID 764206, 9 pages, 2008. View at Publisher · View at Google Scholar · View at PubMed
  43. A. Cichocki and R. Zdunek, “NMFLAB for signal and image processing,” Laboratory for Advanced Brain Signal Processing, BSI, RIKEN, Saitama, Japan, 2006.
  44. A. Cichocki, S. Amari, R. Zdunek, R. Kompass, G. Hori, and Z. He, “Extended SMART algorithms for nonnegative matrix factorization,” in Proceedings of the 8th International Conference on Artificial Intelligence and Soft Computing (ICAISC '06), vol. 4029 of Lecture Notes in Computer Science, pp. 548–562, Springer, Zakopane, Poland, June 2006. View at Publisher · View at Google Scholar
  45. R. Zdunek and A. Cichocki, “Nonnegative matrix factorization with quasi-Newton optimization,” in Proceedings of the 8th International Conference on Artificial Intelligence and Soft Computing (ICAISC '06), vol. 4029 of Lecture Notes in Computer Science, pp. 870–879, Zakopane, Poland, June 2006. View at Publisher · View at Google Scholar
  46. P. Paatero, “Least-squares formulation of robust nonnegative factor analysis,” Chemometrics and Intelligent Laboratory Systems, vol. 37, no. 1, pp. 23–35, 1997. View at Publisher · View at Google Scholar
  47. P. Paatero and U. Tapper, “Positive matrix factorization: a nonnegative factor model with optimal utilization of error estimates of data values,” Environmetrics, vol. 5, no. 2, pp. 111–126, 1994. View at Publisher · View at Google Scholar
  48. D. D. Lee and H. S. Seung, “Algorithms for nonnegative matrix factorization,” in Advances in Neural Information Processing Systems 13, pp. 556–562, Denver, Colo, USA, 2000.
  49. Ch.-J. Lin., “On the convergence of multiplicative update algorithms for nonnegative matrix factorization,” IEEE Transactions on Neural Networks, vol. 18, no. 6, pp. 1589–1596, 2007. View at Publisher · View at Google Scholar
  50. M. T. Chu, F. Diele, R. Plemmons, and S. Ragni, “Optimality, computation, and interpretation of nonnegative matrix factorizations,” Departments of Mathematics and Computer Science, Wake Forest University, Winston-Salem, NC, USA, 2004.
  51. P. O. Hoyer, “Nonnegative matrix factorization with sparseness constraints,” Journal of Machine Learning Research, vol. 5, pp. 1457–1469, 2004.
  52. C.-J. Lin, “Projected gradient methods for nonnegative matrix factorization,” Neural Computation, vol. 19, no. 10, pp. 2756–2779, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at MathSciNet
  53. A. Cichocki and R. Zdunek, “Multilayer nonnegative matrix factorization using projected gradient approaches,” International Journal of Neural Systems, vol. 17, no. 6, pp. 431–446, 2007. View at Publisher · View at Google Scholar
  54. A Cichocki and R. Zdunek, “Multilayer nonnegative matrix factorization,” Electronics Letters, vol. 42, no. 16, pp. 947–948, 2006. View at Publisher · View at Google Scholar
  55. A. Cichocki and R. Zdunek, “Regularized alternating least squares algorithms for nonnegative matrix/tensor factorizations,” in Proceedings of the 4th International Symposium on Neural Networks on Advances in Neural Networks ( ISNN '07), vol. 4493 of Lecture Notes in Computer Science, pp. 793–802, Springer, Nanjing, China, June 2007. View at Publisher · View at Google Scholar
  56. R. Zdunek and A. Cichocki, “Nonnegative matrix factorization with constrained second-order optimization,” Signal Processing, vol. 87, no. 8, pp. 1904–1916, 2007. View at Publisher · View at Google Scholar
  57. B. Johansson, T. Elfving, V. Kozlov, Y. Censor, P.-E. Forssén, and G. Granlund, “The application of an oblique-projected Landweber method to a model of supervised learning,” Mathematical and Computer Modelling, vol. 43, no. 7-8, pp. 892–909, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  58. J. Barzilai and J. M. Borwein, “Two-point step size gradient methods,” IMA Journal of Numerical Analysis, vol. 8, no. 1, pp. 141–148, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  59. G. Narkiss and M. Zibulevsky, “Sequential subspace optimization method for large-scale unconstrained problems,” Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa, Israel, October 2005.
  60. M. Elad, B. Matalon, and M. Zibulevsky, “Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization,” Applied and Computational Harmonic Analysis, vol. 23, no. 3, pp. 346–367, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  61. S. Bellavia, M. Macconi, and B. Morini, “An interior point Newton-like method for nonnegative least-squares problems with degenerate solution,” Numerical Linear Algebra with Applications, vol. 13, no. 10, pp. 825–846, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  62. V. Franc, V. Hlaváč, and M. Navara, “Sequential coordinate-wise algorithm for the nonnegative least squares problem,” in Proceedings of the 11th International Conference on Computer Analysis of Images and Patterns (CAIP '05), A. Gagalowicz and W. Philips, Eds., vol. 3691 of Lecture Notes in Computer Science, pp. 407–414, Springer, Versailles, France, September 2005. View at Publisher · View at Google Scholar
  63. M. Bertero and P. Boccacci, Introduction to Inverse Problems in Imaging, Institute of Physics, Bristol, UK, 1998.
  64. Y.-H. Dai and R. Fletcher, “Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming,” Numerische Mathematik, vol. 100, no. 1, pp. 21–47, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  65. A. Nemirovski, “Orth-method for smooth convex optimization,” Izvestiia Akademii Nauk SSSR. Tekhnicheskaia Kibernetika, vol. 2, 1982 (Russian).
  66. R. W. Freund and N. M. Nachtigal, “QMR: a quasi-minimal residual method for non-Hermitian linear systems,” Numerische Mathematik, vol. 60, no. 1, pp. 315–339, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  67. R. Fletcher, “Conjugate gradient methods for indefinite systems,” in Proceedings of the Dundee Biennial Conference on Numerical Analysis, pp. 73–89, Springer, Dundee, Scotland, July 1975. View at Publisher · View at Google Scholar
  68. C. Lanczos, “Solution of systems of linear equations by minimized iterations,” Journal of Research of the National Bureau of Standards, vol. 49, no. 1, pp. 33–53, 1952.
  69. H. A. van der Vorst, “Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems,” SIAM Journal on Scientific and Statistical Computing, vol. 13, no. 2, pp. 631–644, 1992. View at Publisher · View at Google Scholar
  70. Y. Saad and M. H. Schultz, “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems,” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 3, pp. 856–869, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  71. M. R. Hestenes and E. Stiefel, “Method of conjugate gradients for solving linear systems,” Journal of Research of the National Bureau of Standards, vol. 49, pp. 409–436, 1952.
  72. P. C. Hansen, Rank-Deficient and Discrete Ill-Posed Problems, SIAM, Philadelphia, Pa, USA, 1998.
  73. C. C. Paige and M. A. Saunders, “LSQR: an algorithm for sparse linear equations and sparse least squares,” ACM Transactions on Mathematical Software, vol. 8, no. 1, pp. 43–71, 1982. View at Publisher · View at Google Scholar
  74. J. G. Nagy and Z. Strakos, “Enforcing nonnegativity in image reconstruction algorithms,” in Mathematical Modeling, Estimation, and Imaging, vol. 4121 of Proceedings of SPIE, pp. 182–190, San Diego, Calif, USA, July 2000. View at Publisher · View at Google Scholar