A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing

DOI10.1109/TSP.2015.2508778zbMath1414.94345arXiv1510.08917OpenAlexW2245855345MaRDI QIDQ4622017

Chong-Yung Chi, Tsung-Han Chan, Yu-Hsiang Wang, Chia-Hsiang Lin

Publication date: 8 February 2019

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

Full work available at URL: https://arxiv.org/abs/1510.08917

Mathematics Subject Classification ID

Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (3)

Smoothed separable nonnegative matrix factorization ⋮ Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms

This page was built for publication: A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing