mlsanityData to 14 Oct 2026

Multitemporal Latent Dynamical Framework for Hyperspectral Images Unmixing

arXiv 2505.20902 ↗First posted 27 May 2025eess.IV cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Multitemporal hyperspectral unmixing can capture dynamical evolution of materials. Despite its capability, current methods emphasize variability of endmembers while neglecting dynamics of abundances, which motivates our adoption of neural ordinary differential equations to model abundances temporally. However, this motivation is hindered by two challenges: the inherent complexity in defining, modeling and solving problem, and the absence of theoretical support. To address above challenges, in this paper, we propose a multitemporal latent dynamical (MiLD) unmixing framework by capturing dynamical evolution of materials with theoretical validation. For addressing multitemporal hyperspectral unmixing, MiLD consists of problem definition, mathematical modeling, solution algorithm and theoretical support. We formulate multitemporal unmixing problem definition by conducting ordinary differential equations and developing latent variables. We transfer multitemporal unmixing to mathematical model by dynamical discretization approaches, which describe the discreteness of observed sequence images with mathematical expansions. We propose algorithm to solve problem and capture dynamics of materials, which approximates abundance evolution by neural networks. Furthermore, we provide theoretical support by validating the crucial properties, which verifies consistency, convergence and stability theorems. The major contributions of MiLD include defining problem by ordinary differential equations, modeling problem by dynamical discretization approach, solving problem by multitemporal unmixing algorithm, and presenting theoretical support. Our experiments on both synthetic and real datasets have validated the utility of our work

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 77 references that are in the map. First posted on arXiv 27 May 2025.

Builds on

19 of 77 references.

References · 19

  1. 2018Neural Ordinary Differential Equationscited by 3,779
  2. 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 506
  3. 2018An Augmented Linear Mixing Model to Address Spectral Variability for Hyperspectral Unmixingcited by 66
  4. 2017EndNet: Sparse AutoEncoder Network for Endmember Extraction and Hyperspectral Unmixingcited by 29
  5. 2021Endmember-Guided Unmixing Network (EGU-Net): A General Deep Learning Framework for Self-Supervised Hyperspectral Unmixingcited by 29
  6. 2021Binary Change Guided Hyperspectral Multiclass Change Detectioncited by 20
  7. 2015Hyperspectral unmixing with spectral variability using a perturbed linear mixing modelcited by 17
  8. 2020A Plug-and-Play Priors Framework for Hyperspectral Unmixingcited by 13
  9. 2022Dual-Stage Approach Toward Hyperspectral Image Super-Resolutioncited by 13
  10. 2019Spectral Variability Aware Blind Hyperspectral Image Unmixing Based on Convex Geometrycited by 12
  11. 2015Dynamical spectral unmixing of multitemporal hyperspectral imagescited by 9
  12. 2023GlobalMind: Global Multi-head Interactive Self-attention Network for Hyperspectral Change Detectioncited by 9
7 more
  1. 2020Kalman Filtering and Expectation Maximization for Multitemporal Spectral Unmixingcited by 8
  2. 2023Dynamical Hyperspectral Unmixing with Variational Recurrent Neural Networkscited by 8
  3. 2014Unsupervised Unmixing of Hyperspectral Images Accounting for Endmember Variabilitycited by 7
  4. 2015Online Unmixing of Multitemporal Hyperspectral Images accounting for Spectral Variabilitycited by 6
  5. 2024SpecDETR: A transformer-based hyperspectral point object detection networkcited by 6
  6. 2019Learning Endmember Dynamics in Multitemporal Hyperspectral Data Using a State-Space Model Formulationcited by 4
  7. 2024Transformer for Multitemporal Hyperspectral Image Unmixingcited by 4

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.