Pages that link to "Item:Q4569969"
From MaRDI portal
The following pages link to A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing (Q4569969):
Displayed 14 items.
- A lattice matrix method for hyperspectral image unmixing (Q545317) (← links)
- On statistical learning of simplices: unmixing problem revisited (Q820821) (← links)
- Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data (Q1666730) (← links)
- On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms (Q1932910) (← links)
- A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing (Q2028037) (← links)
- Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation (Q2970895) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory (Q5150834) (← links)
- SISAL Revisited (Q5863525) (← links)
- Sets that maximize probability and a related variational problem (Q6059519) (← links)
- Geodesic simplex based multiobjective endmember extraction for nonlinear hyperspectral mixtures (Q6066176) (← links)
- Alternating direction method of multipliers for linear hyperspectral unmixing (Q6107870) (← links)
- A new convex model for linear hyperspectral unmixing (Q6145222) (← links)