參考文獻 |
Bibliographies
[1] G.H. Golub and C. Reinsch. “Singular value decomposition and least squares solutions”. Numerische Mathematik, 14(5):403–420, 1970.
[2] I. Jolliffe. “Principal component analysis”. Wiley Online Library, 2005.
[3] D.D. Lee and H.S. Seung. “Learning the parts of objects by nonnegative matrix factorization”. Nature, 401(6755):788–791, 1999.
[4] I. Jung, J. Lee, S. Lee, and D. Kim. “Application of nonnegative matrix factorization to improve profile-profile alignment features for fold recognition and remote homolog detection”. BMC Bioinformatics, 9(1):298, 2008.
[5] W. Xu, X. Liu, and Y. Gong. “Document clustering based on non-negative matrix factorization”. In Proceedings of ACM SIGIR Conference on Research and Development in Informaion Retrieval, pages 267–273. ACM, 2003.
[6] P. Smaragdis and J.C. Brown. “Non-negative matrix factorization for polyphonic music transcription”. In IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, pages 177–180. IEEE, 2003.
[7] C. Févotte, N. Bertin, and J. Durrieu. “Nonnegative matrix factorization with the itakura-saito divergence: With application to music analysis”. Neural Computation, 21(3):793–830, 2009.
[8] J. 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, 101(12):4164–4169, 2004.
[9] T. Li and C. Ding. “The relationships among various nonnegative matrix factorization methods for clustering”. In Proceedings of International Conference on Data Mining (ICDM), pages 362–371. IEEE, 2006.
[10] C. Ding, X. He, and H.D. Simon. “On the equivalence of nonnegative matrix factorization and spectral clustering”. In Proceedings of SIAM International Conference on Data Mining (SDM), pages 606–610, 2005.
[11] Paatero, P. and Tapper, U., “Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values,” Environ-metrics, vol. 5, pp. 111–126, 1994.
[12] Gao, Y. and Church, G., “Improving molecular cancer class discovery through sparse non-negative matrix factorization,” Bioinformatics, vol. 21, no. 21, pp. 3970–3975, 2005.
[13] Kim, H. and Park, H., “Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis,” Bioinformatics, vol. 23, no. 12, pp. 1495–1502, 2007.
[14] Cichocki, A. and Phan, A. H., “Fast local algorithms for large scale nonnegative matrix and tensor factorizations,” IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E92A, no. 3, pp. 708–721, 2009.
[15] Virtanen, T., “Monaural sound source separation by nonnegative matrix factorization with temporal continuity and sparseness criteria,” IEEE Trans. On Audio, Speech, and Language Processing, vol. 15, no. 3, pp. 1066–1074, 2007.
[16] Zhang, S., Wang, W., Ford, J., and Makedon, F., “Learning from incomplete ratings using non-negative matrix factorization,” in SDM ’06: Proc. of SIAM Int. Conf. on Data Mining, pp. 548–552, 2006.
[17] D.D. Lee, H.S. Seung, “Algorithms for non-negative matrix factorization”, in: Advances in Neural Information Processing Systems, 2000.
[18] C. Lin. “Projected gradient methods for nonnegative matrix factorization”. Neural Computation, 19(10):2756–2779, 2007.
[19] V.P. Pauca, J. Piper, and R.J. Plemmons. “Nonnegative matrix factorization for spectral data analysis”. Linear Algebra and Its Applications, 416(1):29–47, 2006.
[20] W. S. Zheng, J. H. Lai, S. Liao, and R. He, “Extracting non-negative basis images using pixel dispersion penalty”, Pattern Recognition, vol. 45, no. 8, pp. 2912–2926, 2012.
[21] N. Pal, and S. Pal, “A review on segmentation techniques,” Pattern Recognition, vol. 26, no. 9, pp. 1277-1294, 1993.
[22] S. Angelina, L. P. Suresh, and S. H. Krishna Veni, “Image Segmentation Based On Genetic Algorithm for Region Growth and Region Merging,” Int’l Conf. Computing Electronics and Electrical Technologies. (ICCEET), 2012, pp. 970-974.
[23] S. Haifeng, “Clustering Color Image Segmentation Based on Maximum Entropy,” Proc. 2nd Int’l Conf. Computer Application and System Modeling. (ICCASM), 2012, pp. 1466- 1468.
[24] O. Veksler, Y. Boykov, and P. Mehrani, “Superpixels and supervoxels in an energy optimization framework,” Conf. European Computer Vision, 2010.
[25] A. Levinshtein, A. Stere, K. Kutulakos, D. Fleet, and S. Dickinson, and K. Siddiqi, “Turbopixels: Fast superpixels using geometric flows,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2290-2297, 2009
[26] P. Felzenszwalb, and D. Huttenlocher, “Efficient graph-based image segmentation,” Int’l J. Computer Vision, vol. 59, no. 2, pp. 167–181, 2004]
[27] J. Shi, and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000
[28] D. Comaniciu, and P. Meer, “Mean shift: a robust approach toward feature space analysis,” IEEE on Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603–619, 2002]
[29] A. Vedaldi, and S. Soatto, “Quick shift and kernel methods for mode seeking,” Proc. Conf. Computer Vision, 2008.
[30] L. Vincent, and P. Soille, “Watersheds in digital spaces: An efficient algorithm based on immersion simulations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583–598, 1991.
[31] R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Susstrunk, “SLIC superpixels compared to state-of-the-art superpixel methods,” IEEE PAMI, pp. 2274–2282, 2012.
[32] S.P. Lloyd, “Least Squares Quantization in PCM,” IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129-137, Mar. 1982.
[33] C. Elkan, “Using the Triangle Inequality to Accelerate K-Means,” Proc. Int’l Conf. Machine Learning, 2003.
[34] O. Verevka and J.W. Buchanan, “Local K-Means Algorithm for Color Image Quantization,” Proc. Graphics Interface, pp. 128-135, 1995
[35] A. Kumar, Y. Sabharwal, and S. Sen, “A Simple Linear Time (1+e)-Approximation Algorithm for K-Means Clustering in Any Dimensions,” Proc. Ann. IEEE Symp. Foundations of Computer Science, pp. 454-462, 2004.
[36] T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu, “A Local Search Approximation Algorithm for K-Means Clustering,” Proc. 18th Ann. Symp. Computational Geometry, pp. 10-18, 2002.
[37] C. Elkan, “Using the Triangle Inequality to Accelerate K-Means,” Proc. Int’l Conf. Machine Learning, 2003.
[38] J. Kim, T. Han, Y. W. Tai, and J. Kim, “Salient Region Detection via High-Dimensional Color Transform,” Conf. Computer Vision and Pattern Recognition.(CVPR), 2014, pp. 883-890
[39] N. Guan, D. Tao, Z. Luo, and J. Shawe-Taylor. (2012) “MahNMF: Manhattan non-negative matrix factorization.” [Online]. Available: http://arxiv.org/abs/1207.3438.
[40] M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman, “The PASCAL Visual Object Classes Challenge 2007,” http://www.pascalnetwork.org/challenges/VOC/voc2007.
[41] C. F´ evotte and J. Idier, “Algorithms for nonnegative matrix factorization with the beta-divergence,” Neural Computer, vol. 23, no. 9, pp. 2421–2456, 2011.
[42] P. O. Hoyer, “Non-negative sparse coding,” in Proc. IEEE Workshop Neural Netw. Signal Process, 2002, pp. 557–565.]
[43] J. Bobin, J. L. Starck, J. Fadili, and Y. Moudden, “Sparsity and morphological diversity in blind source separation,” IEEE Trans. Image Process., vol. 16, no. 11, pp. 2662–2674, 2007.
[44] W. S. Zheng, J. H. Lai, S. Liao, and R. He, “Extracting non-negative basis images using pixel dispersion penalty,” Pattern Recognition, vol. 45, no. 8, pp. 2912–2926, 2012.
[45] J. L. Roux, F.Weninger, and J. R. Hershey, “Sparse NMF – half-baked or well done?” Mitsubishi Electric Research Laboratories Technical Report, 2015.
[46] S. Seneff, J. Glass, Zue, “Speech database development at MIT: Timit and beyond,” Speech Communication, vol 9, no. 4, pp. 351-356, 1990.
[47] E. Vincent, R. Gribonval, and C. Fevotte, “Performance measurement in blind audio source separation,” IEEE Trans. Audio, Speech, Lang. Process., 2006.
[48] C. L. Hsu, and J. S. Jang, “On the improvement of singing voice separation for monaural recordings using the MIR-1 K dataset,” IEEE Trans. Audio, Speech, Lang. Process., vol. 18, no. 2, pp. 310–319, 2010.
[49] D. Cai, X. He, X. Wu, and J. Han, “Non-negative matrix factorization on manifold,” in Proc. IEEE Int. Conf. Data Mining (ICDM ’08), December 2008, pp. 63– 72.
[50] Q. Gu, J. Zhou, “Neighborhood preserving non-negative matrix factorization,” in Proc British Machine Vision Conference, 2009.
[51] Q. Gu, J. Zhou, “Local learning regularized nonnegative matrix factorization,” in Proc Int. Joint Conferences on Artificial Intelligence, 2009, pp. 1046–1051.
[52] Tuan Pham, Yuan-Shan Lee,Yan-Bo Lin,Tzu-Chiang Tai and Jia-Ching Wang, “Single Channel Source Separation Using Sparse NMF and Graph Regularization”, ASE BD&SI 2015, October 07 - 09, 2015, Kaohsiung, Taiwan.
[52] Christos Boutsidis and Efstratios Gallopoulos. “SVD-based initialization: A head start for nonnegative matrix factorization”. Pattern Recognition, 41(4): 1350-1362, 2008.
[53] Jingu Kim and Haesun Park, “Sparse Nonnegative Matrix Factorization for Clustering”, College of Computing, Georgia Institute of Technology, 266 Ferst Drive, Atlanta, GA 30332, USA.
[54] Cai, D., He, X., Han, J., Huang, “Graph regularized nonnegative matrix factorization for data representation”. IEEE Transactions on Pattern Analysis and Machine Intelligence 33(8), 1548–1560 (2011).
[55] J. Karvanen, A. Cichocki, “Measuring sparseness of noisy signals,” in Proc. Int. International Symposium on Independent Component Analysis and Blind Signal Separation,( ICA), 2003, pp. 125–130.
[56] Yifeng Li, Alioune Ngom, “The non-negative matrix factorization toolbox for biological data mining”, licensee BioMed Central Ltd. 2013
[57] C. M. Bishop, Pattern Recognition and Machine Learning. Springer, 2006.
[58] The ORL database of Face. Website: http://www.cl.cam.ac.uk/research/dtg/attarchive/facedatabase.html
[59] S. A. Nene, S. K. Nayar and H. Murase, “Columbia Object Image Library (COIL-20)," Technical Report CUCS-005-96, February 1996.
[60] Database by Georgia Institute of Technology. Website: http://www.anefian.com/research/facereco.html.
[61] Chih-Jen Lin and Jorge J. Mor´e. “Newton’s method for large-scale bound constrained problems”. SIAM Journal on Optimization, 9:1100–1127, 1999. |