Published on Fri Nov 02 2018

Low-Rank Tensor Modeling for Hyperspectral Unmixing Accounting for Spectral Variability

Tales Imbiriba, Ricardo Augusto Borsoi, José Carlos Moreira Bermudez

Traditional hyperspectral unmixing methods neglect the underlying variability of spectral signatures. We propose a more flexible approach called ULTRA-V that imposes low-rank structures through regularizations whose strictness is controlled by scalar parameters.

0
0
0
Abstract

Traditional hyperspectral unmixing methods neglect the underlying variability of spectral signatures often observed in typical hyperspectral images (HI), propagating these missmodeling errors throughout the whole unmixing process. Attempts to model material spectra as members of sets or as random variables tend to lead to severely ill-posed unmixing problems. Although parametric models have been proposed to overcome this drawback by handling endmember variability through generalizations of the mixing model, the success of these techniques depend on employing appropriate regularization strategies. Moreover, the existing approaches fail to adequately explore the natural multidimensinal representation of HIs. Recently, tensor-based strategies considered low-rank decompositions of hyperspectral images as an alternative to impose low-dimensional structures on the solutions of standard and multitemporal unmixing problems. These strategies, however, present two main drawbacks: 1) they confine the solutions to low-rank tensors, which often cannot represent the complexity of real-world scenarios; and 2) they lack guarantees that endmembers and abundances will be correctly factorized in their respective tensors. In this work, we propose a more flexible approach, called ULTRA-V, that imposes low-rank structures through regularizations whose strictness is controlled by scalar parameters. Simulations attest the superior accuracy of the method when compared with state-of-the-art unmixing algorithms that account for spectral variability.

Fri Mar 16 2018
Computer Vision
A Low-rank Tensor Regularization Strategy for Hyperspectral Unmixing
Tensor-based methods have recently emerged as a more natural and effective formulation to address many problems in hyperspectral imaging. This paper introduces a new low-rank tensor regularization that adequately captures the low- Rank structure underlying the abundance maps.
0
0
0
Tue Mar 30 2021
Computer Vision
Using Low-rank Representation of Abundance Maps and Nonnegative Tensor Factorization for Hyperspectral Nonlinear Unmixing
0
0
0
Thu Apr 14 2016
Computer Vision
Unsupervised Nonlinear Spectral Unmixing based on a Multilinear Mixing Model
Non linear mixing models have recently received particular attention in hyperspectral image processing. The proposed unmixing method is unsupervised in the sense that the endmembers are estimated jointly with the abundances and other parameters of interest, i.e., the transition probability.
0
0
0
Wed Jan 22 2014
Machine Learning
Nonlinear hyperspectral unmixing with robust nonnegative matrix factorization
This paper introduces a robust mixing model to describe hyperspectral data. The data fidelity term is expressed as a beta-divergence. The penalized objective is minimized with a block-coordinate descent.
0
0
0
Fri Jul 19 2019
Computer Vision
Matrix cofactorization for joint spatial-spectral unmixing of hyperspectral images
Hyperspectral unmixing aims at identifying a set of elementary spectra and the corresponding mixture coefficients for each pixel of an image. An evaluation of the proposed method is conducted on synthetic and real data.
0
0
0
Tue Apr 07 2015
Machine Learning
Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing
Inverse problems are known to be structured in several ways at the same time. This premise has recently guided the research to the innovative idea of imposing multiple constraints on the parameters involved in the problem under study. The adoption of suitably combined combined constraints imposing sparsity and low-rankness, is expected to yield substantially enhanced estimation results.
0
0
0