Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing
DOI10.1016/J.APM.2021.09.043zbMATH Open1525.94022OpenAlexW3210330720WikidataQ114208747 ScholiaQ114208747MaRDI QIDQ6135569FDOQ6135569
Author name not available (Why is that?)
Publication date: 25 August 2023
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2021.09.043
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Tensor Decompositions and Applications
- Decoding by Linear Programming
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Nonnegative matrix factorization for spectral data analysis
- Total Variation Structured Total Least Squares Method for Image Restoration
- Spectral Unmixing via Data-Guided Sparsity
- Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization
Cited In (1)
This page was built for publication: Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135569)