A Convex Optimization-Based Coupled Nonnegative Matrix Factorization Algorithm for Hyperspectral and Multispectral Data Fusion

Chia Hsiang Lin, Fei Ma, Chong Yung Chi, Chih Hsiang Hsieh

研究成果: Article

10 引文 (Scopus)

摘要

Fusing a low-spatial-resolution hyperspectral data with a high-spatial-resolution (HSR) multispectral data has been recognized as an economical approach for obtaining HSR hyperspectral data, which is important to accurate identification and classification of the underlying materials. A natural and promising fusion criterion, called coupled nonnegative matrix factorization (CNMF), has been reported that can yield high-quality fused data. However, the CNMF criterion amounts to an ill-posed inverse problem, and hence, advisable regularization can be considered for further upgrading its fusion performance. Besides the commonly used sparsity-promoting regularization, we also incorporate the well-known sum-of-squared-distances regularizer, which serves as a convex surrogate of the volume of the simplex of materials' spectral signature vectors (i.e., endmembers), into the CNMF criterion, thereby leading to a convex formulation of the fusion problem. Then, thanks to the biconvexity of the problem nature, we decouple it into two convex subproblems, which are then, respectively, solved by two carefully designed alternating direction method of multipliers (ADMM) algorithms. Closed-form expressions for all the ADMM iterates are derived via convex optimization theories (e.g., Karush-Kuhn-Tucker conditions), and furthermore, some matrix structures are employed to obtain alternative expressions with much lower computational complexities, thus suitable for practical applications. Some experimental results are provided to demonstrate the superior fusion performance of the proposed algorithm over state-of-the-art methods.

原文English
頁(從 - 到)1652-1667
頁數16
期刊IEEE Transactions on Geoscience and Remote Sensing
56
發行號3
DOIs
出版狀態Published - 2018 三月

指紋

Convex optimization
Data fusion
Factorization
matrix
spatial resolution
inverse problem
Inverse problems
data quality
Computational complexity
method
material

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Earth and Planetary Sciences(all)

引用此文

@article{dc438c2ea46040c18205d8900de408df,
title = "A Convex Optimization-Based Coupled Nonnegative Matrix Factorization Algorithm for Hyperspectral and Multispectral Data Fusion",
abstract = "Fusing a low-spatial-resolution hyperspectral data with a high-spatial-resolution (HSR) multispectral data has been recognized as an economical approach for obtaining HSR hyperspectral data, which is important to accurate identification and classification of the underlying materials. A natural and promising fusion criterion, called coupled nonnegative matrix factorization (CNMF), has been reported that can yield high-quality fused data. However, the CNMF criterion amounts to an ill-posed inverse problem, and hence, advisable regularization can be considered for further upgrading its fusion performance. Besides the commonly used sparsity-promoting regularization, we also incorporate the well-known sum-of-squared-distances regularizer, which serves as a convex surrogate of the volume of the simplex of materials' spectral signature vectors (i.e., endmembers), into the CNMF criterion, thereby leading to a convex formulation of the fusion problem. Then, thanks to the biconvexity of the problem nature, we decouple it into two convex subproblems, which are then, respectively, solved by two carefully designed alternating direction method of multipliers (ADMM) algorithms. Closed-form expressions for all the ADMM iterates are derived via convex optimization theories (e.g., Karush-Kuhn-Tucker conditions), and furthermore, some matrix structures are employed to obtain alternative expressions with much lower computational complexities, thus suitable for practical applications. Some experimental results are provided to demonstrate the superior fusion performance of the proposed algorithm over state-of-the-art methods.",
author = "Lin, {Chia Hsiang} and Fei Ma and Chi, {Chong Yung} and Hsieh, {Chih Hsiang}",
year = "2018",
month = "3",
doi = "10.1109/TGRS.2017.2766080",
language = "English",
volume = "56",
pages = "1652--1667",
journal = "IEEE Transactions on Geoscience and Remote Sensing",
issn = "0196-2892",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - A Convex Optimization-Based Coupled Nonnegative Matrix Factorization Algorithm for Hyperspectral and Multispectral Data Fusion

AU - Lin, Chia Hsiang

AU - Ma, Fei

AU - Chi, Chong Yung

AU - Hsieh, Chih Hsiang

PY - 2018/3

Y1 - 2018/3

N2 - Fusing a low-spatial-resolution hyperspectral data with a high-spatial-resolution (HSR) multispectral data has been recognized as an economical approach for obtaining HSR hyperspectral data, which is important to accurate identification and classification of the underlying materials. A natural and promising fusion criterion, called coupled nonnegative matrix factorization (CNMF), has been reported that can yield high-quality fused data. However, the CNMF criterion amounts to an ill-posed inverse problem, and hence, advisable regularization can be considered for further upgrading its fusion performance. Besides the commonly used sparsity-promoting regularization, we also incorporate the well-known sum-of-squared-distances regularizer, which serves as a convex surrogate of the volume of the simplex of materials' spectral signature vectors (i.e., endmembers), into the CNMF criterion, thereby leading to a convex formulation of the fusion problem. Then, thanks to the biconvexity of the problem nature, we decouple it into two convex subproblems, which are then, respectively, solved by two carefully designed alternating direction method of multipliers (ADMM) algorithms. Closed-form expressions for all the ADMM iterates are derived via convex optimization theories (e.g., Karush-Kuhn-Tucker conditions), and furthermore, some matrix structures are employed to obtain alternative expressions with much lower computational complexities, thus suitable for practical applications. Some experimental results are provided to demonstrate the superior fusion performance of the proposed algorithm over state-of-the-art methods.

AB - Fusing a low-spatial-resolution hyperspectral data with a high-spatial-resolution (HSR) multispectral data has been recognized as an economical approach for obtaining HSR hyperspectral data, which is important to accurate identification and classification of the underlying materials. A natural and promising fusion criterion, called coupled nonnegative matrix factorization (CNMF), has been reported that can yield high-quality fused data. However, the CNMF criterion amounts to an ill-posed inverse problem, and hence, advisable regularization can be considered for further upgrading its fusion performance. Besides the commonly used sparsity-promoting regularization, we also incorporate the well-known sum-of-squared-distances regularizer, which serves as a convex surrogate of the volume of the simplex of materials' spectral signature vectors (i.e., endmembers), into the CNMF criterion, thereby leading to a convex formulation of the fusion problem. Then, thanks to the biconvexity of the problem nature, we decouple it into two convex subproblems, which are then, respectively, solved by two carefully designed alternating direction method of multipliers (ADMM) algorithms. Closed-form expressions for all the ADMM iterates are derived via convex optimization theories (e.g., Karush-Kuhn-Tucker conditions), and furthermore, some matrix structures are employed to obtain alternative expressions with much lower computational complexities, thus suitable for practical applications. Some experimental results are provided to demonstrate the superior fusion performance of the proposed algorithm over state-of-the-art methods.

UR - http://www.scopus.com/inward/record.url?scp=85036595834&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036595834&partnerID=8YFLogxK

U2 - 10.1109/TGRS.2017.2766080

DO - 10.1109/TGRS.2017.2766080

M3 - Article

AN - SCOPUS:85036595834

VL - 56

SP - 1652

EP - 1667

JO - IEEE Transactions on Geoscience and Remote Sensing

JF - IEEE Transactions on Geoscience and Remote Sensing

SN - 0196-2892

IS - 3

ER -