Using Low-rank Representation of Abundance Maps and Nonnegative Tensor
Factorization for Hyperspectral Nonlinear Unmixing
- URL: http://arxiv.org/abs/2103.16204v1
- Date: Tue, 30 Mar 2021 09:37:25 GMT
- Title: Using Low-rank Representation of Abundance Maps and Nonnegative Tensor
Factorization for Hyperspectral Nonlinear Unmixing
- Authors: Lianru Gao, Zhicheng Wang, Lina Zhuang, Haoyang Yu, Bing Zhang,
Jocelyn Chanussot
- Abstract summary: We propose a nonlinear low-rank tensor unmixing algorithm to solve the generalized bilinear model (GBM)
Specifically, the linear and nonlinear parts of the GBM can both be expressed as tensors.
Low-rank structures of abundance maps and nonlinear interaction maps are exploited by minimizing their nuclear norm.
- Score: 28.064111391414773
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Tensor-based methods have been widely studied to attack inverse problems in
hyperspectral imaging since a hyperspectral image (HSI) cube can be naturally
represented as a third-order tensor, which can perfectly retain the spatial
information in the image. In this article, we extend the linear tensor method
to the nonlinear tensor method and propose a nonlinear low-rank tensor unmixing
algorithm to solve the generalized bilinear model (GBM). Specifically, the
linear and nonlinear parts of the GBM can both be expressed as tensors.
Furthermore, the low-rank structures of abundance maps and nonlinear
interaction abundance maps are exploited by minimizing their nuclear norm, thus
taking full advantage of the high spatial correlation in HSIs. Synthetic and
real-data experiments show that the low rank of abundance maps and nonlinear
interaction abundance maps exploited in our method can improve the performance
of the nonlinear unmixing. A MATLAB demo of this work will be available at
https://github.com/LinaZhuang for the sake of reproducibility.
Related papers
- Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation [71.69331824668954]
Low-rank tensor representation is an important approach to alleviate spectral variations.
Previous low-rank representation methods can only be applied to the regular data cubes.
We propose a novel irregular lowrank representation method that can efficiently model the irregular 3D cubes.
arXiv Detail & Related papers (2024-10-24T02:56:22Z) - High-Dimensional Tensor Discriminant Analysis with Incomplete Tensors [5.745276598549783]
We introduce a novel approach to tensor classification with incomplete data, framed within high-dimensional linear discriminant analysis.
Our method demonstrates excellent performance in simulations and real data analysis, even with significant proportions of missing data.
arXiv Detail & Related papers (2024-10-18T18:00:16Z) - Weight-based Decomposition: A Case for Bilinear MLPs [0.0]
Gated Linear Units (GLUs) have become a common building block in modern foundation models.
Bilinear layers drop the non-linearity in the "gate" but still have comparable performance to other GLUs.
We develop a method to decompose the bilinear tensor into a set of interacting eigenvectors.
arXiv Detail & Related papers (2024-06-06T10:46:51Z) - Dynamical chaos in nonlinear Schr\"odinger models with subquadratic
power nonlinearity [137.6408511310322]
We deal with a class of nonlinear Schr"odinger lattices with random potential and subquadratic power nonlinearity.
We show that the spreading process is subdiffusive and has complex microscopic organization.
The limit of quadratic power nonlinearity is also discussed and shown to result in a delocalization border.
arXiv Detail & Related papers (2023-01-20T16:45:36Z) - Low-Rank Tensor Function Representation for Multi-Dimensional Data
Recovery [52.21846313876592]
Low-rank tensor function representation (LRTFR) can continuously represent data beyond meshgrid with infinite resolution.
We develop two fundamental concepts for tensor functions, i.e., the tensor function rank and low-rank tensor function factorization.
Our method substantiates the superiority and versatility of our method as compared with state-of-the-art methods.
arXiv Detail & Related papers (2022-12-01T04:00:38Z) - Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View
Tomography [58.60249163402822]
Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations.
The proposed OMR is more robust and performs significantly better than the previous state-of-the-art OMR approach.
arXiv Detail & Related papers (2022-07-06T21:40:59Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - Graph Embedding via High Dimensional Model Representation for
Hyperspectral Images [9.228929858529678]
Learning the manifold structure of remote sensing images is of paramount relevance for modeling and understanding processes.
Manor learning methods have shown excellent performance to deal with hyperspectral image (HSI) analysis.
A common assumption to deal with the problem is that the transformation between the high-dimensional input space and the (typically low) latent space is linear.
The proposed method is compared to manifold learning methods along with its linear counterparts and achieves promising performance in terms of classification accuracy of a representative set of hyperspectral images.
arXiv Detail & Related papers (2021-11-29T16:42:15Z) - Nonlinear Transform Induced Tensor Nuclear Norm for Tensor Completion [12.788874164701785]
We propose a low-rank tensor completion (LRTC) model along the theoretical convergence of the NTTNN and the PAM algorithm.
Our method outperforms linear transform-based state-of-the-art nuclear norm (TNN) methods qualitatively and quantitatively.
arXiv Detail & Related papers (2021-10-17T09:25:37Z) - HyperNTF: A Hypergraph Regularized Nonnegative Tensor Factorization for
Dimensionality Reduction [2.1485350418225244]
We propose a novel method, called Hypergraph Regularized Nonnegative Factorization (HyperNTF)
HyperNTF can preserve nonnegativity in tensor factorization, and uncover the higher-order relationship among the nearest neighborhoods.
Experiments show that HyperNTF robustly outperforms state-of-the-art algorithms in clustering analysis.
arXiv Detail & Related papers (2021-01-18T01:38:47Z) - Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling.
We design a novel structured tensor low-rank norm tailored to MVSC.
We show that the proposed method outperforms state-of-the-art methods to a significant extent.
arXiv Detail & Related papers (2020-04-30T11:52:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.