Evaluation of Different Algorithms of Nonnegative Matrix Factorization in Temporal Psychovisual Modulation

Temporal psychovisual modulation (TPVM) is a newly proposed information display paradigm, which can be implemented by nonnegative matrix factorization (NMF) with additional upper bound constraints on the variables. In this paper, we study all the state-of-the-art algorithms in NMF, extend them to incorporate the upper bounds and discuss their potential use in TPVM. By comparing all the NMF algorithms with their extended versions, we find that: 1) the factorization error of the truncated alternating least squares algorithm always fluctuates throughout the iterations, 2) the alternating nonnegative least squares based algorithms may slow down dramatically under the upper bound constraints, and 3) the hierarchical alternating least squares (HALS) algorithm converges the fastest and its final factorization error is often the smallest among all the algorithms. Based on the experimental results of the HALS, we propose a guideline of determining the parameter setting of TPVM, that is, the number of viewers to support and the scaling factor for adjusting the light intensity of the images formed by TPVM. This paper will facilitate the applications of TPVM.

[1]  Inderjit S. Dhillon,et al.  Fast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation Problem , 2007, SDM.

[2]  Hyunsoo Kim,et al.  Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method , 2008, SIAM J. Matrix Anal. Appl..

[3]  Haesun Park,et al.  Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons , 2011, SIAM J. Sci. Comput..

[4]  Nicolas Gillis,et al.  Sparse and unique nonnegative matrix factorization through data preprocessing , 2012, J. Mach. Learn. Res..

[5]  Inderjit S. Dhillon,et al.  Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem , 2008, Stat. Anal. Data Min..

[6]  Chih-Jen Lin,et al.  Projected Gradient Methods for Nonnegative Matrix Factorization , 2007, Neural Computation.

[7]  Xin Liu,et al.  Document clustering based on non-negative matrix factorization , 2003, SIGIR.

[8]  Lachezar Komitov,et al.  Fast liquid crystal light shutter , 2011 .

[9]  Andrzej Cichocki,et al.  Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Nicolas Gillis,et al.  Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization , 2011, Neural Computation.

[11]  Nicolas Gillis,et al.  A multilevel approach for nonnegative matrix factorization , 2010, J. Comput. Appl. Math..

[12]  Antonio Ortega,et al.  New Coding Tools for Illumination and Focus Mismatch Compensation in Multiview Video Coding , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[13]  Yin Zhang,et al.  Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization , 2005 .

[14]  Chris H. Q. Ding,et al.  On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering , 2005, SDM.

[15]  Michael W. Berry,et al.  Algorithms and applications for approximate nonnegative matrix factorization , 2007, Comput. Stat. Data Anal..

[16]  P. Paatero,et al.  Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values† , 1994 .

[17]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[18]  John Shawe-Taylor,et al.  MahNMF: Manhattan Non-negative Matrix Factorization , 2012, ArXiv.

[19]  Xiaolin Wu,et al.  Backward compatible stereoscopic displays via temporal psychovisual modulation , 2012, SIGGRAPH 2012.

[20]  Stephen A. Vavasis,et al.  On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..

[21]  W. Gao,et al.  Inter-View Direct Mode for Multiview Video Coding , 2006, IEEE Transactions on Circuits and Systems for Video Technology.

[22]  I. Dhillon,et al.  A New Projected Quasi-Newton Approach for the Nonnegative Least Squares Problem , 2006 .

[23]  Haesun Park,et al.  Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[24]  Greg Welch,et al.  Spatially augmented reality , 1999 .

[25]  Nancy Bertin,et al.  Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis , 2009, Neural Computation.

[26]  Andrzej Cichocki,et al.  Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization , 2007, ICA.

[27]  Changshui Zhang,et al.  Efficient Nonnegative Matrix Factorization via projected Newton method , 2012, Pattern Recognit..

[28]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[29]  V. P. Pauca,et al.  Nonnegative matrix factorization for spectral data analysis , 2006 .

[30]  I. Dhillon,et al.  Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem , 2008 .

[31]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[32]  Bernd Fröhlich,et al.  C1x6: a stereoscopic six-user display for co-located collaboration in shared virtual environments , 2011, SA '11.

[33]  Xiaolin Wu,et al.  Temporal Psychovisual Modulation: A New Paradigm of Information Display [Exploratory DSP] , 2012, IEEE Signal Processing Magazine.

[34]  Nicolas Gillis,et al.  Nonnegative Factorization and The Maximum Edge Biclique Problem , 2008, 0810.4225.

[35]  J. Li,et al.  An Epipolar Geometry-Based Fast Disparity Estimation Algorithm for Multiview Image and Video Coding , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[36]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.