Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A state-space approach to dynamic nonnegative matrix factorization
University of Oldenburg, Germany.
University of Illinois .
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
University of Oldenburg, Germany.
2015 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 63, no 4, 949-959 p.Article in journal (Refereed) Published
Abstract [en]

Nonnegative matrix factorization (NMF) has been actively investigated and used in a wide range of problems in the past decade. A significant amount of attention has been given to develop NMF algorithms that are suitable to model time series with strong temporal dependencies. In this paper, we propose a novel state-space approach to perform dynamic NMF (D-NMF). In the proposed probabilistic framework, the NMF coefficients act as the state variables and their dynamics are modeled using a multi-lag nonnegative vector autoregressive (N-VAR) model within the process equation. We use expectation maximization and propose a maximum-likelihood estimation framework to estimate the basis matrix and the N-VAR model parameters. Interestingly, the N-VAR model parameters are obtained by simply applying NMF. Moreover, we derive a maximum a posteriori estimate of the state variables (i.e., the NMF coefficients) that is based on a prediction step and an update step, similarly to the Kalman filter. We illustrate the benefits of the proposed approach using different numerical simulations where D-NMF significantly outperforms its static counterpart. Experimental results for three different applications show that the proposed approach outperforms two state-of-the-art NMF approaches that exploit temporal dependencies, namely a nonnegative hidden Markov model and a frame stacking approach, while it requires less memory and computational power.

Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2015. Vol. 63, no 4, 949-959 p.
Keyword [en]
Constrained Kalman filtering, nonnegative dynamical system (NDS), nonnegative matrix factorization (NMF), prediction, probabilistic latent component analysis (PLCA)
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-157745DOI: 10.1109/TSP.2014.2385655ISI: 000348457800011Scopus ID: 2-s2.0-84921749170OAI: oai:DiVA.org:kth-157745DiVA: diva2:771534
Note

QC 20141219

Available from: 2014-12-14 Created: 2014-12-14 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

fulltext(1058 kB)194 downloads
File information
File name FULLTEXT01.pdfFile size 1058 kBChecksum SHA-512
725ba615068104b7e1c3162a4be1dc7e5f33ec22efe2aefa276117ebc9b488e230a294a60ea98c28883a4a71446e257151d14bc5b79c027ef056af6924300b07
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Mohammadiha, NasserPanahandeh, Ghazaleh
By organisation
Signal ProcessingACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 194 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 246 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf