A new convex model for linear hyperspectral unmixing

DOI10.1016/j.cam.2023.115708MaRDI QIDQ6145222

Tao Tan, Yan-Yan Li

Publication date: 30 January 2024

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

strongly convexmatrix function optimizationadaptive moment methodlinear hyperspectral unmixing (LHU)

Mathematics Subject Classification ID

Inference from stochastic processes and spectral analysis (62M15) Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• An overview on linear unmixing of hyperspectral data
• A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

This page was built for publication: A new convex model for linear hyperspectral unmixing