返回
Biobjective Nonnegative Matrix Factorization: Linear Versus Kernel-Based Models
DOI:10.1109/TGRS.2016.2535298.png)
摘要
En 中文
Nonnegative matrix factorization (NMF) is a powerful class of feature extraction techniques that has been successfully applied in many fields, particularly in signal and image processing. Current NMF techniques have been limited to a single-objective optimization problem, in either its linear or nonlinear kernel-based formulation. In this paper, we propose to revisit the NMF as a multiobjective problem, particularly a biobjective one, where the objective functions defined in both input and feature spaces are taken into account. By taking the advantage of the sum-weighted method from the literature of multiobjective optimization, the proposed biobjective NMF determines a set of nondominated, Pareto optimal, solutions. Moreover, the corresponding Pareto front is approximated and studied. Experimental results on unmixing synthetic and real hyperspectral images confirm the efficiency of the proposed biobjective NMF compared with the state-of-the-art methods.
Keyword:
Hyperspectral image
kernel machines
nonnegative matrix factorization (NMF)
Pareto optimal
unmixing problem
期刊
IF:
8.6
论文数:
2.1W
被引数:
10.7W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Subsystem identification through dimensionality reduction of large-scale gene expression data
GENOME RESEARCH
IF5.5
Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imagery高光谱图像物质量化的全约束最小二乘线性光谱混合分析方法

