A Two Stage Algorithm for K-Mode Convolutive Nonnegative Tucker Decomposition
Higher order tensor model has been seen as a potential mathematical framework to manipulate the multiple factors underlying the observations. In this paper, we propose a flexible two stage algorithm for K-mode Convolutive Nonnegative Tucker Decomposition (K-CNTD) model by an alternating least square procedure. This model can be seen as a convolutive extension of Nonnegative Tucker Decomposition (NTD). Shift-invariant features in different subspaces can be extracted by the K-CNTD algorithm. We impose additional sparseness constraint on the algorithm to find the part-based representations. Extensive simulation results indicate that the K-CNTD algorithm is efficient and provides good performance for a feature extraction task.
KeywordsSpeaker Recognition Tensor Factorization Sparse Constraint Noisy Condition Speaker Modeling
Unable to display preview. Download preview PDF.
- 1.Cichocki, A., Zdunek, R., Phan, A.H.: Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation. John Wiley and Sons (2009)Google Scholar
- 7.Mørup, M.: Applications of tensor (multiway array) factorizations and decompositions in data mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 1, 24–40 (2011)Google Scholar
- 10.Kim, Y.D., Choi, S.: Nonnegative tucker decomposition. In: CVPR 2007, pp. 1–8 (2007)Google Scholar