.png){kind=icon}
Return
Online kernel nonnegative matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2016.08.011.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Nonnegative matrix factorization
Online learning
Kernel machines
Hyperspectral unmixing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
Supervised Nonlinear Spectral Unmixing Using a Postnonlinear Mixing Model for Hyperspectral Imagery
OAAI
.png){kind=icon}
OAAIShareSaveShareSaveShareSave
View more