A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

DOI10.1109/TSP.2009.2025802MaRDI QIDQ4569969zbMATH OpenOpenAlexFDO

Authors Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing-Kin Ma

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2009.2025802

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
• Hyperspectral unmixing by the alternating direction method of multipliers
• A Complexity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
• A novel measurement matrix optimization approach for hyperspectral unmixing
• A two-step iterative algorithm for sparse hyperspectral unmixing via total variation
• Alternating direction method of multipliers for linear hyperspectral unmixing
• A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing
• A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing

Cited in

(17)

• Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data
• A novel measurement matrix optimization approach for hyperspectral unmixing
• On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms
• A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing
• Minimal volume simplex (MVS) polytopic model generation and manipulation methodology for TP model transformation
• Enhancing pure-pixel identification performance via preconditioning
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
• A lattice matrix method for hyperspectral image unmixing
• SISAL revisited
• Sets that maximize probability and a related variational problem
• Geodesic simplex based multiobjective endmember extraction for nonlinear hyperspectral mixtures
• Alternating direction method of multipliers for linear hyperspectral unmixing
• A new convex model for linear hyperspectral unmixing
• Dual simplex volume maximization for simplex-structured matrix factorization
• A general framework for group sparsity in hyperspectral unmixing using endmember bundles
• On statistical learning of simplices: unmixing problem revisited

This page was built for publication: A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569969)