2017
DOI: 10.1109/tgrs.2016.2633279
|View full text |Cite
|
Sign up to set email alerts
|

Matrix-Vector Nonnegative Tensor Factorization for Blind Unmixing of Hyperspectral Imagery

Abstract: Many spectral unmixing approaches ranging from geometry, algebra to statistics have been proposed, in which nonnegative matrix factorization (NMF) based ones form an important family. The original NMF based unmixing algorithm loses the spectral and spatial information between mixed pixels when stacking the spectral responses of the pixels into an observed matrix. Therefore, various constrained NMF methods are developed to impose spectral structure, spatial structure, and spectral-spatial joint structure into N… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
183
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 172 publications
(199 citation statements)
references
References 52 publications
0
183
0
1
Order By: Relevance
“…But utilizing this model for HSR was never considered, to the best knowledge of the authors. Nevertheless, the interesting results obtained in [14] offers numerical evidence for that real spectral images can be well approximated by the (Lr, Lr, 1) BTD model.…”
Section: Proposed Approachmentioning
confidence: 88%
See 2 more Smart Citations
“…But utilizing this model for HSR was never considered, to the best knowledge of the authors. Nevertheless, the interesting results obtained in [14] offers numerical evidence for that real spectral images can be well approximated by the (Lr, Lr, 1) BTD model.…”
Section: Proposed Approachmentioning
confidence: 88%
“…To circumvent this issue, in this work, we propose to employ the block term decomposition (BTD) [11,12,13] model for the spectral images. Under BTD with rank-(Lr, Lr, 1) terms, the latent factors have explicit physical explanations under the widely adapted LMM-i.e., endmembers and abundances maps-if the abundance maps are approximately low-rank matrices [14]. We show that, under reasonable conditions, the new model also guarantees the recovery of the SRI.…”
Section: Introductionmentioning
confidence: 86%
See 1 more Smart Citation
“…S INCE hyperspectral imagery consists of tens or hundreds of bands with a very high spectral resolution, it has drawn more attention from various applications in the past decades, such as spectral unmixing [1], [2], classification [3], [4], target detection [5], [6] and so on. However, high spectral dimensionality with strong intraband correlations also results in informantion redundancy and computational burden of data processing [7].Therefore, dimensionality reduction (DR) has become one of the most important techniques for addressing these problems.…”
Section: Introductionmentioning
confidence: 99%
“…These kinds of methods have been proven to be able to unmix highly mixed data and obtain a higher decomposition accuracy, despite the relatively high computation complexity. The representative algorithms of the statistical methods include the independent component analysis (ICA) [15,16], nonnegative matrix/tensor factorization (NMF/NTF) [17,18], and Bayesian approaches [19].…”
Section: Introductionmentioning
confidence: 99%