- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 259863, 11 pages
Dictionary Learning Based on Nonnegative Matrix Factorization Using Parallel Coordinate Descent
1Graduate School of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan
2School of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan
3Department 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via minimization,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 5, pp. 2197–2202, 2003.
- B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” The Annals of Statistics, vol. 32, no. 2, pp. 407–499, 2004.
- 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.
- 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.
- 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.
- K. Skretting and K. Engan, “Recursive least squares dictionary learning algorithm,” IEEE Transactions on Signal Processing, vol. 58, no. 4, pp. 2121–2130, 2010.
- 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.
- D. D. Lee and H. S. Seung, “Algorithms for non-negative matrix factorization,” in Advances in Neural Information Processing Systems, pp. 556–562, 2000.
- 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.
- 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.
- Y. Gao and G. Church, “Improving molecular cancer class discovery through sparse non-negative matrix factorization,” Bioinformatics, vol. 21, pp. 3970–3975, 2005.
- 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.
- 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.
- 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.
- R. Tandon and S. Sra, “Sparse nonnegative matrix approximation: new formulations and algorithms,” Tech. Rep. 193, MPI, 2010.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.