4.6 Article

Online kernel nonnegative matrix factorization

Journal

SIGNAL PROCESSING
Volume 131, Issue -, Pages 143-153

Publisher

ELSEVIER
DOI: 10.1016/j.sigpro.2016.08.011

Keywords

Nonnegative matrix factorization; Online learning; Kernel machines; Hyperspectral unmixing

Funding

  1. French ANR [ANR-12BS03-0033]

Ask authors/readers for more resources

Nonnegative matrix factorization (NMF) has become a prominent signal processing and data analysis technique. To address streaming data, online methods for NMF have been introduced recently, mainly restricted to the linear model. In this paper, we propose a framework for online nonlinear NMF, where the factorization is conducted in a kernel-induced feature space. By exploring recent advances in the stochastic gradient descent and the mini-batch strategies, the proposed algorithms have a controlled computational complexity. We derive several general update rules, in additive and multiplicative strategies, and detail the case of the Gaussian kernel. The performance of the proposed framework is validated on unmixing synthetic and real hyperspectral images, comparing to state-of-the-art techniques. (C) 2016 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available