Distributed dyadic cyclic descent for non-negative matrix factorization

Magnus O. Ulfarsson; Victor Solo; Jakob Sigurdsson; Johannes R. Sveinsson

ICASSP 2016accepted0 citations

Distributed dyadic cyclic descent for non-negative matrix factorization

Magnus O. Ulfarsson, Victor Solo, Jakob Sigurdsson, Johannes R. Sveinsson

Abstract

Non-negative matrix factorization (NMF) has found use in fields such as remote sensing and computer vision where the signals of interest are usually non-negative. Data dimensions in these applications can be huge and traditional algorithms break down due to unachievable memory demands. One is then compelled to consider distributed algorithms. In this paper, we develop for the first time a distributed version of NMF using the alternating direction method of multipliers (ADMM) algorithm and dyadic cyclic descent. The algorithm is compared to well established variants of NMF using simulated data, and is also evaluated using real remote sensing hyperspectral data.

BibTeX

@inproceedings{icassp2016_distributeddyadi,
  title = {Distributed dyadic cyclic descent for non-negative matrix factorization},
  author = {Magnus O. Ulfarsson and Victor Solo and Jakob Sigurdsson and Johannes R. Sveinsson},
  booktitle = {ICASSP 2016},
  year = {2016}
}