Abstract and Applied Analysis

Volume 2013 (2013), Article ID 259863, 11 pages

http://dx.doi.org/10.1155/2013/259863

## Dictionary Learning Based on Nonnegative Matrix Factorization Using Parallel Coordinate Descent

^{1}Graduate School of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan^{2}School of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan^{3}Department for Student Affairs, University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan

Received 28 February 2013; Accepted 16 May 2013

Academic Editor: Yong Zhang

Copyright © 2013 Zunyi Tang et al. 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

Sparse representation of signals via an overcomplete dictionary has recently received much attention as it has produced promising results in various applications. Since the nonnegativities of the signals and the dictionary are required in some applications, for example, multispectral data analysis, the conventional dictionary learning methods imposed simply with nonnegativity may become inapplicable. In this paper, we propose a novel method for learning a nonnegative, overcomplete dictionary for such a case. This is accomplished by posing the sparse representation of nonnegative signals as a problem of nonnegative matrix factorization (NMF) with a sparsity constraint. By employing the coordinate descent strategy for optimization and extending it to multivariable case for processing in parallel, we develop a so-called parallel coordinate descent dictionary learning (PCDDL) algorithm, which is structured by iteratively solving the two optimal problems, the learning process of the dictionary and the estimating process of the coefficients for constructing the signals. Numerical experiments demonstrate that the proposed algorithm performs better than the conventional nonnegative K-SVD (NN-KSVD) algorithm and several other algorithms for comparison. What is more, its computational consumption is remarkably lower than that of the compared algorithms.

#### 1. Introduction

Dictionary learning, building a dictionary consisting of atoms or subspaces so that a class of signals can be efficiently and sparsely represented in terms of the atoms, is an important topic in machine learning, neuroscience, signal processing, and so forth. Since in some applications the nonnegativities of the signals and the dictionary are required, for example, multispectral data analysis [1, 2], nonnegative factorization for recognition [3, 4], and some other important problems [5, 6], the so-called nonnegative dictionary learning becomes necessary. In this paper, we mainly focus on this topic.

In the model of sparse representation of signals, a basic assumption is that using an overcomplete dictionary matrix that contains atoms of size for columns, , each column vector of a signal matrix can be represented as a linear combination of very few, which is meant by the terminology of sparse, atoms of dictionary . Here, the term “overcomplete” means . or satisfying are two ways to represent . The corresponding matrix that contains the representation coefficients of signals is called the coefficient matrix. For dictionary , it can be either generated by a prespecified set of functions or learned by a given set of training signals. In practices [7, 8], learning a dictionary has proved to be critical to achieve superior results in the domains of signal and image processing.

Naturally, the problem of finding a dictionary and its sparse representation with the fewest number of atoms can be modeled by using the -norm. Considering the fact that the -norm optimization problem is generally NP-hard, one frequently used heuristic is the -minimization [9]. A series of studies has led to many dictionary learning algorithms. Several classical algorithms include LARS [10], K-SVD [11], ILS-DLA [12], ODL [13], and RLS-DLA [14]. Although these algorithms are very efficient in general, they are not always suitable for learning a nonnegative dictionary from nonnegative signals. For example, a nonnegative variant of K-SVD, which is termed “NN-KSVD” [15], is not as efficient as K-SVD because the negative elements generated in a dictionary matrix are intentionally set to zero to guarantee nonnegativity as the dictionary updates.

In recent years, nonnegative matrix factorization (NMF) [2, 16] has been widely applied to data analyses having nonnegativity constraints since NMF can factorize a nonnegative matrix into a product of two nonnegative factor matrices with different properties. Intuitively, NMF is similar to sparse representation of nonnegative signals to some extent. However, the standard NMF algorithms [17] do not impose any constraints on the two factors, except for nonnegativity, which is not sufficient to lead to a sparse enough representation. In order to obtain a sparser representation, various sparsity constrained NMF algorithms have been proposed. Hoyer et al. [18–20] considered enforcing the sparsity of coefficient matrix using -norm. Hoyer [21] also introduced a measure of sparsity based on the ratio of the -norm of a vector to the -norm. Some algorithms imposed sparsity constraints by using -norm [5, 22, 23]. Peharz et al. [24, 25] presented sparse NMF algorithms that constrain the -(pseudo-) norm of the coefficient matrix. In addition, several approaches based on other types of constraints, such as nonsmoothness constraint [26], squared -norm penalization [27], and mixed-norm [28], have been proposed recently.

Inspired by the sparsity constrained NMF, in this paper we present a new method for learning a nonnegative overcomplete dictionary for sparse representation of nonnegative signals. Differently from the optimization strategies used in the conventional sparsity constrained NMF, this method employs the coordinate descent strategy [29] and extends it to multivariable case for optimizing multiple independent variables in factors, thus resulting in the so-called parallel coordinate descent strategy. We present the update rules based on the new strategy and develop an algorithm, which is termed as the parallel coordinate descent dictionary learning (PCDDL) algorithm, to solve our objective problem. The proposed algorithm is very efficient since the objective problem has been cast as two sequential optimal problems of quadratic functions not involving the complicated calculations inherent to factorization. Through experimental evaluations, we have observed that the proposed algorithm achieves the best rate of atom recovery compared with the conventional algorithms [15, 18, 21, 25]. In addition, its performance is robust even if noise is quite heavy. Furthermore, the computation cost of our algorithm is much lower than that of other algorithms because it does not involve the complicated calculations.

The remaining part of the paper is organized as follows. In Section 2, we formulate the nonnegative dictionary learning problem. In Section 3, we describe the proposed PCDDL algorithm for nonnegative dictionary learning. In Section 4, we report the results of numerical experiments using PCDDL and compare these results with those of several other algorithms. These experiments involve two groups of synthetic datasets and two preliminary applications involving image processing. Finally, in Section 5, we draw our conclusions and discuss related research topics for the future.

#### 2. Problem Formulation

Given a vector , whose components are a group of signals, we are now concerned with its sparse representation over an overcomplete dictionary , each column of which is referred to an atom. That is, we attempt to find a linear combination of only few atoms, which can be close to in value. To avoid trivial solutions, is restricted to the set , which is defined as

For a training set of signals , dictionary learning can be formulated as the following optimization problem: where and Here is a penalty function with , which is a tuning parameter controlling the tradeoff between the approximation error and the penalty function .

Naturally, the problem of learning a dictionary and finding a sparse representation can be modeled by using the -norm, defining as the -norm of ; namely, . However, the resulting optimization problem is usually NP-hard. Considering this difficulty, one frequently used heuristic is the -norm; that is, [9].

With the use of the -norm, the dictionary learning problem is expressed as follows: Noted that it is allowed to take different values of for different penalty functions . For the sake of simplicity, however, we assume here that the same is applied to every penalty function. Thus, (4) can be also rewritten as a matrix factorization problem with a sparsity penalty, where denotes the -norm of the matrix , that is, the sum of the -norm of each column vector of the matrix .

Furthermore, if is nonnegative and factors and are both limited to be nonnegative, then the process is called nonnegative dictionary learning, which can be formulated as,

To solve the problem in (6), a natural strategy is to optimize between and alternatively. That is, minimize one while keeping the other fixed. The NN-KSVD algorithm [18] and some NMF algorithms including NNSC, NMFSC, and NMF-H, just solve the problem in such a way.

#### 3. The Proposed Method

##### 3.1. Parallel Coordinate Descent Dictionary Learning (PCDDL)

To solve the objective problem (6), we first employ alternating update strategy, that is, updating one of two factors while fixing the other. In the optimization of each factor, we propose optimizing each component in the factor one by one by generalizing the coordinate descent strategy [29], rather than optimizing the whole factor at a time as in the standard NMF algorithms [17]. Furthermore, we found that (6) can be separated into column-wise or row-wise subproblems, and each subproblem can just be solved alternately and explicitly by utilizing the properties of solving extreme value problem of a quadratic function, so that the whole problem can be solved efficiently.

We here derive the update rules for and of (6). In terms of the definition and properties of the Frobenius norm, for a matrix . denotes the trace of a square matrix. Thus, the objective function (6) can be decomposed as follows: where denotes the th row of the multiplication of matrices and . Since the elements of have nonnegativity, the absolute value operation in (7) can be omitted. If we fix in (7), then (7) is a multivariable objective function of . First, let us explain the coordinate descent strategy for a single variable. For (7), we consider optimizing only a single variable , while fixing the other components in . Thus, we obtain a quadratic function with regard to as follows: where denotes the entry in the th row and the th column of the multiplication of matrices and . is always positive because it is a diagonal element of Gram matrix (no zero vectors exist in here, also). Thus, when reaches the minimum. Considering the nonnegativity of factor is set to 0 when it is negative. Note that, when updating , the process involves only the elements of the th column in . That is, the optimal value for a given entry of does not depend on the other components of the same row containing the entry. Hence, one can optimize all elements of one row in at the same time. This can be viewed as optimizing the elements in parallel, that is, parallel coordinate descent strategy for multiple variables. Thus, the update rule for of (7) is given as follows: where .

Similar to the derivation of the update rule for , one can also obtain the corresponding update rule for . If fixing in (7), then (7) is a multivariable objective function of . For (7), we now consider optimizing only one variable , while fixing the other components in . We first select the items related to from (7) and obtain a quadratic function with regard to as follows: One can find that (10) is very similar to (8). In terms of the properties of a single variable quadratic problem, obtains the minimum when . Considering the nonnegativity of factor is set to 0 when it is negative. Similar to the update rule for in (7) can update by column. Thus, the update rule for of (7) is expressed as follows: In addition, for preventing dictionary from having arbitrarily large values, each column of is normalized to the unit -norm when dictionary is updating. Note that the way of maintaining the nonnegativity of two factor matrices in PCDDL is obviously different from that of NN-KSVD. The former can guarantee that the obtained nonnegative solutions are the optimal relative to each column-wise or row-wise updating, but the latter cannot.

*Remark 1. *According to the above derivation, it can be observed that our objective function (7) can be cast as two sequential optimal problems of quadratic functions, each of which can be alternately optimized in parallel by the generalized coordinate descent strategy.

*Remark 2. *The sparsity of can be flexibly controlled by tuning the regularization parameter .

*Remark 3. *The method is suitable not only for the case of overdetermined dictionary matrices () but also for the case of underdetermined dictionary matrices (), even though these matrices have different physical meanings in different applications.

##### 3.2. Choice of Parameter and Summary of Algorithm

In the step of updating with a fixed , the parameter can be adjusted for controlling the tradeoff between the approximation error and the sparsity of coefficient matrix and plays an important role in the proposed algorithm. To steer the solution toward a global, optimal solution, the parameter can be determined by two kinds of ways, off-line calibrating and adaptive tuning.

For the first way, one can repeat an experiment with different and determine what value for is the optimal according to the output results.

For the second way, we give an easy-to-use rule as follows. First, should be less than in terms of (9); otherwise will become a zero vector. We may initialize with a very small value, for example, 0.001, which can generally satisfy the above condition. Next, we alternately update and in terms of (9) and (11) and adjust according to the rule defined as follows:
where is a sparsity measure, defined as , which calculates the ratio of the number of nonzero elements and the number of all elements in . and denote the value of and the sparsity of in the th iteration, respectively. denotes the expected or *a prior* sparsity of . The rule means that if the sparsity of varies very slowly and is far from the expected one, one may appropriately increase the stepsize of ; otherwise, keep the current . Experiments show that the values of obtained by the two ways are very close. If is self-tuned for adapting to signal, however, more iterations are usually needed for convergence.

According to the analysis above, the proposed PCDDL algorithm for nonnegative dictionary learning is summarized in Algorithm 1.

##### 3.3. Convergence Analysis of PCDDL Algorithm

The standard NMF algorithms [17] belong to two-block convex optimization scheme since each factor can be viewed as a block, and optimizing one of two factors while fixing the other is separately convex. Grippo and Sciandrone analyzed the convergence of the two-block convex optimization problems in [30]. They demonstrated that under the condition of continuously differentiable objective function, a two-block convex optimization algorithm does not require each subproblem to have a unique solution for convergence, and any limit point of the sequence of optimal solutions of two-block subproblems is a stationary point. Obviously, PCDDL is such a two-block convex optimization algorithm, so that we can make analysis of its convergence by using the facts in [30]. During iterations, PCDDL can obtain a sequence of the limit points that can guarantee the reduction of objective function. Additionally, in terms of the definition of -norm, the penalty term in (6) can be decomposed into since . Thus, under the conditions of , the objective function (6) is differentiable with respect to and , respectively. The existence of limit points and the differentiability of the objective function in (6) imply that the assumptions of Grippo and Sciandrone’s Corollary [30] are satisfied, so that we can establish that the two-block minimization processes of PCDDL converge.

#### 4. Numerical Experiments

In this section, first we present the results of two experiments using PCDDL with synthetic signals. The aims of these experiments are to test whether the PCDDL algorithm can recover the true dictionary, which is used to generate the test data; and to compare the results with those of other algorithms, such as NNSC (online available: http://www.cs.helsinki.fi/u/phoyer/) [18], NN-KSVD (online available: http://www.cs.technion.ac.il/~elad/) [15], NMFSC (online available: http://www.cs.helsinki.fi/u/phoyer/) [21], and NMF-H (online available: http://www.spsc.tugraz.at/tools/nmf-l0-sparseness-constraints) [25]. Next, we apply PCDDL to a conventional digital image processing problem, image denoising, to verify the applicability of the proposed algorithm in a real-world environment. Finally, we carry out an experiment of learning a global-based representation on a face dataset in order to demonstrate the practicality of the proposed algorithm for further large-scale data analysis. In the experiments, all programs were coded in Matlab and were run within Matlab 7.8 (R2009a) on a PC with a 3.2 GHz Intel Core i5 CPU and 4 G of memory.

##### 4.1. Recovery Experiment of Random Dictionary

To evaluate the learning capacity of the proposed algorithm for a nonnegative dictionary, we conducted an experiment of recovering a random dictionary from synthetic observation signals generated from the random dictionary. By comparing the recovery rate of the dictionary, adaptability, runtime, and so forth*,* we assess the algorithms under consideration (see above). The processes are as follows. We generated a stochastic nonnegative matrix of size 20 × 50 with i.i.d. uniformly distributed entries, as described in [11]. Each vector was normalized to unit -norm. The stochastic nonnegative matrix was referred to as the true dictionary , which was not used in the learning but was used only for evaluation. We then synthesized 1500 test signals of dimension 20, each of which was produced by a linear combination of three different atoms in the true dictionary, with three corresponding coefficients in random and independent positions. We executed NNSC, NMFSC, NN-KSVD, NMF-H, and PCDDL on the test signals. For the five algorithms, the initialized dictionary matrices of size 20 × 50 were composed of the randomly selected parts of the test signals. For NNSC, NMFSC, and PCDDL, the corresponding coefficient matrices were initialized with i.i.d. uniformly distributed random nonnegative entries. NN-KSVD and NMF-H do not require a specified coefficient matrix, as they can generate the corresponding coefficient matrix by sparse coding.

Next, we compared the learned dictionaries with the true dictionary. These comparisons were done by sweeping through the columns of the true and the learned dictionaries and finding the closest column (in -norm distance) between the two dictionaries. A distance of less than 0.01 was considered a success. The experiment is similar to the one conducted in [11], except for the nonnegative condition. Obviously, the five iterative algorithms described above have different convergence properties. To provide fair limits on the number of the respective iterations, we executed these algorithms with the same iterations as many times as possible and determined respective iteration number in terms of the results shown in Figures 1, 2, and 3. NNSC and NMFSC, respectively, took about 3000 iterations to reach convergence, while NMF-H took only dozens of iterations. In addition, we also considered the runtime of each algorithm as showed in Figure 2. Thus, we set the maximum numbers of iterations for NNSC, NMFSC, NN-KSVD, NMF-H, and PCDDL to 3000, 3000, 300, 30, and 500, respectively. Certainly, the iteration of any algorithm can be terminated in advance if it has learned 100% of the atoms before reaching the maximum number of iterations.

Besides the noiseless condition, we also made experiments in which the uniformly distributed positive noise of varying signal-to-noise ratios (SNRs) was corrupted to the test signals in order to evaluate the performance and robustness of antinoise. All trials were repeated 15 times with different initialized dictionaries. Figure 4 shows the results of the experiment for noise levels of 10, 20, and 30 dB and for the noiseless case. Obviously, NMFSC and NN-KSVD performed worst, especially under lower SNR conditions. NMF-H performed better than NNSC, NMFSC, and NN-KSVD under various conditions. The proposed PCDDL performed best on dictionary learning, although it performed only slightly better than NMF-H under various conditions. The average runtime of each trial for these algorithms was 35 s, 146 s, 244 s, 24 s, and 4 s, respectively. Obviously, PCDDL has a remarkable advantage in computational consumption. Note that, in the experiment, NN-KSVD and NMF-H required a specified, exact number of nonzero elements in the coefficient matrix (3/50 = 0.06 for the case) as shown in Figure 3, and NMFSC was executed with a sparsity factor of 0.8 on the coefficients. For NNSC and PCDDL, the sparsity of the coefficient matrices was adjusted via the regularization parameters . In the experiment, the corresponding parameters were set to 0.2 in both the cases, which was calibrated off-line through several trials. The two parameters were fixed during iterations in order to reduce the number of iterations and computational cost.

##### 4.2. Recovery Experiment of Decimal Digits Dictionary

To further investigate the potential practicality of the proposed PCDDL algorithm, we considered the 10 decimal digits dataset from [15]. The dataset is composed of 90 images of size 8 8, representing 10 decimal digits with various position shifts. Note that a mistake exists in the original dataset, in which some atoms are duplicated. In the original dataset, for example, the atoms of the first column are the same as the ones of the fifth column. Before the experiment, we corrected the problem by making all the atoms different.

Before beginning the experiment, we first generated 3000 training signals of size 64 × 1, each of which is a random linear combination of 5 different atoms with random positive coefficients. That is, there are uniformly 5 nonzero elements in each vector of the corresponding coefficient matrix. In order to learn original dictionary, the training signals were input into the five algorithms, NNSC, NMFSC, NN-KSVD, NMF-H, and PCDDL. We also added the uniformly distributed positive noise of varying SNR to the training signals in order to evaluate the robustness of antinoise. The obtained results are shown in Figure 5.

As the results of the experiments in the above subsection, PCDDL performed better than the other four algorithms at three noise levels and in the noiseless case. The results of NN-KSVD were not as good as described in [15], because we corrected the above-mentioned mistake in the original dataset (i.e., removed duplicated atoms). The duplicated atoms in the original dataset led to the better, but wrong, result in [15] compared with the results of our experiment. Surprisingly, NNSC performed worst in this experiment, and it could almost not learn any correct atoms no matter how the parameters had been chosen. In a typical run, the average runtime of each trial was 412 s, 473 s, 822 s, 136 s and 23 s, respectively. This fact further shows that PCDDL has a remarkable advantage in computational consumption. In Figure 6, we give an example of the experiment under noiseless conditions, in which the four algorithms except NNSC recovered 77, 72, 86, and 89 atoms of 90 atoms, respectively. The result for NNSC was not showed in Figure 6 since it could almost not learn any correct atoms. Figure 6(a) shows the dataset revised by us. Figure 6(f) shows the result obtained by PCDDL, where only one digit 8 could not be recovered correctly. Certainly, PCDDL can either recover 100% of the atoms in considerable cases.

##### 4.3. Image Denoising of Nature Images

Image denoising problem is important, not only because of the obvious applications that it serves. Being the simplest possible inverse problem, it provides a convenient platform through which image processing ideas and techniques can be assessed. In this sense, we intend to apply nonnegative dictionary learning to image denoising problem. Using redundant representations and sparsity as driving forces for denoising of signals constitutes significant progress [31, 32]. In these studies, a typical noise model is , where is the clean image, is assumed to be white Gaussian noise with a fixed standard deviation (the case of nonuniform is dealt with in [33]), and is the noisy observed image. Here, the noise is assumed to be uniformly distributed with nonnegative values, instead of zero-mean white and homogeneous Gaussian noise, since this paper is for studying the sparse representation of nonnegative signals. For solving the denoising problem, we adopted the algorithm presented in [31], which is based on a sparse and redundant representation model on small image patches. In the procedure, the original dictionary learning algorithm is replaced with our proposed PCDDL.

In this set of experiments, the dictionaries used were of size 64 × 256, which were designed to handle image patches of size 8 × 8 pixels. All reported results are presented as an average of three experiments, having different realizations of the noise. Some standard test images including Barbara (512 × 512), House (256 × 256), Boats (512 × 512), Lena (512 × 512), and Peppers (256 × 256) were used in the experiment. We added noise of various levels to the test images. We used two quality measures, the peak SNR (PSNR) and the structural similarity (SSIM), to assess the denoised images. Let and denote the ideal image and the deteriorated image, respectively. We calculate the PSNR value of by PSNR. For SSIM, its value range is between 0 and 1, and its value equals 1 if . For more information about the SSIM index, please refer to references in [34].

In the experiment, we focused on tests with higher noise levels, because it may be more critical. We chose the conventional Wavelets denoising algorithm [35] and the known nonlocal means (NL-means) algorithm [36] as the compared objects. Additionally, we also chose the NMF-H because of its better performance in previous experiments. It is notable that NMF-H is very time-consuming for the dictionary learning procedure, as described in the two experiments above. Table 1 summarizes the results of the denoising experiment. We concluded that the denoising algorithm using the PCDDL dictionary achieved highly competitive PSNR and SSIM performance outcomes compared to that of Wavelets, NL-means, and NMF-H algorithms. When comparing PSNR, the denoising algorithm using the PCDDL dictionary outperformed NL-means in the range of about 0.7 dB2 dB and performed much better than the Wavelets and NMF-H algorithms. When comparing the SSIM index, the denoising algorithm using the PCDDL dictionary returned results comparable to that of the NL-means algorithm. Subjective quality comparisons for two typical test images (Boat and House) are shown in Figures 7 and 8. The PCDDL dictionary learned from the noisy House image in Figure 8 is illustrated in Figure 9.

##### 4.4. Human Face Image Analysis

In this subsection, we describe our experiment on learning a global-based representation [21] using a face dataset. The learning process can be considered to be one kind of principal component analysis. We used the ORL dataset of faces (online available: http://www.cl.cam.ac.uk/research/dtg/attarchive/facedatabase.html). Since the ORL dataset includes 400 facial images of size 92 × 112 pixels, the dataset can be considered to be large scale. Using the dataset, we can evaluate the computational performances of the PCDDL and the other compared algorithms. To assess the experiment fairly, we drove the compared algorithms to obtain the corresponding coefficient matrices and forced them to reach as comparable level of sparsity as possible (based on -norm). By using the Hoyer’s sparsity measure for a vector , defined as we compared the average sparsity of all column vectors in these coefficient matrices. Additionally, we computed the respective relative errors defined below and counted the respective runtime

In the experiment, we performed a global-based feature learning of rank and constrained the coefficient matrices to have a sparsity of about 0.08; that is, each facial image was required to be represented with three facial features (). Besides NMFSC and NMF-H, we chose another sparse NMF algorithm (denoted as SNMF) [20] as the compared objective. Note that NN-KSVD was not included in this experiment, since it has exceedingly high computational consumption. Each of these algorithms required some initialization parameters and a limit on the number of its iterations. For SNMF, we allowed 3000 iterations; and for the parameter , which is used to adjust sparsity, we chose 100. For NMFSC, we only constrained the sparsity of coefficient factor to 0.9 in terms of (13) and executed at most 3000 iterations, which was necessary for convergence. For NMF-H, we set the maximum number of nonzero elements of vectors in factor to 3 (, close to 0.08) and allowed 30 iterations, considering the high computational consumption of NMF-H. For the proposed PCDDL, we allowed at most 200 iterations, and was set to 10, that is, calibrated through several trials. All four algorithms were run three times with the same initial random matrices (for NMF-H, it was not necessary to initialize coefficient ). The averaged results are reported in Table 2.

Through Table 2, it can be observed that SNMF seems to be incapable of obtaining an actual sparse representation, despite the fact that it is designed to enhance sparsity by introducing the -norm. The other three algorithms obtained similar results and produced much sparser solutions, that is, more global-based representations. NMFSC and NMF-H produced lower relative errors but took much more runtime than PCDDL. The runtime of NMFSC and NMF-H was about 14 and 23 times longer than that of PCDDL. In view of its high efficiency, PCDDL is more suitable for large-scale data analysis. In Figure 10, we show an illustration of the global-based features learned by the four algorithms in a typical run.

#### 5. Conclusion

In this paper, we presented a novel and efficient method for learning nonnegative dictionaries for sparse representation of nonnegative signals. In this method, we generalized the coordinate descent strategy for optimization for being able to be applied to a multivariable case, so that it can process in a parallel way. By this strategy we developed an efficient algorithm, which has been named as the parallel coordinate descent dictionary learning (i.e., PCDDL) algorithm. The algorithm updates the dictionary in a column-wise manner and the coefficient matrix in a row-wise manner. In each column-wise or row-wise updating, PCDDL optimizes a series of optimal problems sequentially, each of which is an optimization of a quadratic function. Furthermore, such optimization problems can be solved explicitly, so that the algorithm can be processed very precisely and quickly from a global perspective according to the properties of the univariate quadratic problem. For this reason, the proposed algorithm can efficiently solve the nonnegative dictionary learning problem with very high accuracy.

Results of experiments on dictionary recovery showed that PCDDL can correctly learn a nonnegative, overcomplete dictionary, regardless of wether the objective signals are synthetic data or are natural images. Additionally, further experiments supported the potential application of PCDDL in the field of image processing, such as image denoising, image classification, and large-scale data processing due to its low computational consumption. We are currently working on applying this method to some practical problems in image processing, for example, large-scale image classification. The results from these ongoing studies will be presented in the future.

#### References

- V. P. Pauca, J. Piper, and R. J. Plemmons, “Nonnegative matrix factorization for spectral data analysis,”
*Linear Algebra and its Applications*, vol. 416, no. 1, pp. 29–47, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Miao and H. Qi, “Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization,”
*IEEE Transactions on Geoscience and Remote Sensing*, vol. 45, pp. 765–777, 2007. View at Google Scholar - S. Li, X. Hou, H. Zhang, and Q. Cheng, “Learning spatially localized, parts-based representation,” in
*Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '01)*, pp. 207–212, 2001. - I. Kotsia, S. Zafeiriou, and I. Pitas, “A novel discriminant non-negative matrix factorization algorithm with applications to facial image characterization problems,”
*IEEE Transactions on Information Forensics and Security*, vol. 2, pp. 588–595, 2007. View at Google Scholar - F. Shahnaz, M. W. Berry, V. P. Pauca, and R. J. Plemmons, “Document clustering using nonnegative matrix factorization,”
*Information Processing & Management*, vol. 42, pp. 373–386, 2006. View at Google Scholar - M. Wang, W. Xu, and A. Tang, “A unique “nonnegative” solution to an underdetermined system: from vectors to matrices,”
*IEEE Transactions on Signal Processing*, vol. 59, no. 3, pp. 1007–1016, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - M. Plumbley, T. Blumensath, L. Daudet, R. Gribonval, and M. Davies, “Sparse representations in audio and music: from coding to source separation,”
*Proceedings of the IEEE*, pp. 995–1005, 2010. View at Google Scholar - M. Elad, M. Figueiredo, and Y. Ma, “On the role of sparse and redundant representations in image processing,”
*Proceedings of the IEEE*, vol. 98, pp. 972–982, 2010. View at Google Scholar - D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via ${\ell}^{1}$ minimization,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 100, no. 5, pp. 2197–2202, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,”
*The Annals of Statistics*, vol. 32, no. 2, pp. 407–499, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation,”
*IEEE Transaction on Signal Processing*, vol. 54, pp. 4311–4322, 2006. View at Google Scholar - K. Engan, K. Skretting, and J. H. Husoy, “Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representation,”
*Digital Signal Processing*, vol. 17, pp. 32–49, 2007. View at Google Scholar - J. Mairal, F. Bach, J. Ponce, and G. Sapiro, “Online learning for matrix factorization and sparse coding,”
*Journal of Machine Learning Research*, vol. 11, pp. 19–60, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Skretting and K. Engan, “Recursive least squares dictionary learning algorithm,”
*IEEE Transactions on Signal Processing*, vol. 58, no. 4, pp. 2121–2130, 2010. View at Publisher · View at Google Scholar · View at MathSciNet - M. Aharon, M. Elad, and A. M. Bruckstein, “K-SVD and its non-negative variant for dictionary design,” in
*Proceedings of the SPIE Conference Wavelets*, pp. 327–339. - D. D. Lee and H. S. Seung, “Learning the parts of objects by nonnegative matrix factorization,”
*Nature*, vol. 401, pp. 788–791, 1999. View at Google Scholar - D. D. Lee and H. S. Seung, “Algorithms for non-negative matrix factorization,” in
*Advances in Neural Information Processing Systems*, pp. 556–562, 2000. View at Google Scholar - P. O. Hoyer, “Non-negative sparse coding,” in
*Proceedings of the IEEE Workshop on Neural Networks for Signal Processing*, pp. 557–565. - J. Eggert and E. Korner, “Sparse coding and NMF,” in
*Proceedings of IEEE International Joint Conference on Neural Networks*, pp. 2529–2533. - W. Liu, N. Zheng, and X. Lu, “Non-negative matrix factorization for visual coding,” in
*IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP ’03)*, pp. 293–296, 2003. - P. O. Hoyer, “Non-negative matrix factorization with sparseness constraints,”
*Journal of Machine Learning Research*, vol. 5, pp. 1457–1469, 2004. View at Google Scholar · View at MathSciNet - V. P. Pauca, F. Shahnaz, M. W. Berry, and R. J. Plemmons, “Text mining using non-negative matrix factorizations,” in
*Proceedings of the Fourth SIAM International Conference on Data Mining*, pp. 452–456, SIAM, Philadelphia, Pa, USA, 2004. View at MathSciNet - Y. Gao and G. Church, “Improving molecular cancer class discovery through sparse non-negative matrix factorization,”
*Bioinformatics*, vol. 21, pp. 3970–3975, 2005. View at Google Scholar - R. Peharz, M. Stark, and F. Pernkopf, “Sparse nonnegative matrix factorization using
*ℓ*^{0}-constraints,” in*IEEE International Workshop on Machine Learning for Signal Processing (MLSP '10)*, pp. 83–88, 2010. - R. Peharz and F. Pernkopf, “Sparse nonnegative matrix factorization using
*ℓ*^{0}-constraints,”*Neurocomputing*, vol. 80, pp. 38–46, 2012. View at Google Scholar - A. Pascual-Montano, J. M. Carazo, K. Kochi, D. Lehmann, and R. D. Pascual-Marqui, “Nonsmooth nonnegative matrix factorization (nsNMF),”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 28, pp. 403–415, 2006. View at Google Scholar - H. Kim and H. Park, “Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data
analysis,”
*Bioinformatics*, vol. 23, pp. 1495–1502, 2007. View at Google Scholar - R. Tandon and S. Sra, “Sparse nonnegative matrix approximation: new formulations and algorithms,” Tech. Rep. 193, MPI, 2010. View at Google Scholar
- J. Friedman, T. Hastie, H. Höfling, and R. Tibshirani, “Pathwise coordinate optimization,”
*The Annals of Applied Statistics*, vol. 1, no. 2, pp. 302–332, 2007. View at Publisher · View at Google Scholar · View at MathSciNet - L. Grippo and M. Sciandrone, “On the convergence of the block nonlinear Gauss-Seidel method under convex constraints,”
*Operations Research Letters*, vol. 26, no. 3, pp. 127–136, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,”
*IEEE Transactions on Image Processing*, vol. 15, no. 12, pp. 3736–3745, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - W. Dong, X. Li, L. Zhang, and G. Shi, “Sparsity-based image denoising via dictionary learning and structural clustering,” in
*IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11)*, pp. 457–464, 2011. - J. Mairal, M. Elad, and G. Sapiro, “Sparse representation for color image restoration,”
*IEEE Transactions on Image Processing*, vol. 17, no. 1, pp. 53–69, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - Z. Wang, A. Bovik, H. Sheikh, and E. Simoncelli, “Image quality assessment: from error visibility to structural similarity,”
*IEEE Transactions on Image Processing*, vol. 13, pp. 600–612, 2004. View at Google Scholar - R. Baraniuk, H. Choi, R. Neelamani, and V. Ribeiro, “Rice Wavelet Toolbox,” 2011, http://dsp.rice.edu/software/rice-wavelet-toolbox/.
- A. Buades, B. Coll, and J.-M. Morel, “A non-local algorithm for image denoising,” in
*IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05)*, pp. 60–65, 2005.