MultiHU-TD: Multifeature Hyperspectral Unmixing Based on Tensor Decomposition
원문 초록
Hyperspectral unmixing allows representing mixed pixels as a set of pure materials weighted by their abundances. Spectral features alone are often insufficient, so it is common to rely on other features of the scene. Matrix models become insufficient when the hyperspectral image (HSI) is represented as a high-order tensor with additional features in a multimodal, multifeature framework. Tensor models such as canonical polyadic decomposition allow for this kind of unmixing but lack a general framework and interpretability of the results. In this article, we propose an interpretable methodological framework for low-rank multifeature hyperspectral unmixing based on tensor decomposition (MultiHU-TD) that incorporates the abundance sum-to-one constraint in the alternating optimization alternating direction method of multipliers (ADMM) algorithm and provide in-depth mathematical, physical, and graphical interpretation and connections with the extended linear mixing model. As additional features, we propose to incorporate mathematical morphology and reframe a previous work on neighborhood patches within MultiHU-TD. Experiments on real HSIs showcase the interpretability of the model and the analysis of the results. Python and MATLAB implementations are made available on GitHub.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Fast and Structured Block-Term Tensor Decomposition For Hyperspectral Unmixing
UnMix-NeRF: Spectral Unmixing Meets Neural Radiance Fields
Revisit CP Tensor Decomposition: Statistical Optimality and Fast Convergence
D-Tracker: Modeling Interest Diffusion in Social Activity Tensor Data Streams
Multiscale Tensor Summation Factorization as a New Neural Network Layer (MTS Layer) for Multidimensional Data Processing
Knowledge Graph Completion with Mixed Geometry Tensor Factorization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.