Sciweavers

3 search results - page 1 / 1
» Convex analysis based minimum-volume enclosing simplex algor...
Sort
View
ICASSP
2010
IEEE
13 years 4 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
ICASSP
2009
IEEE
13 years 11 months ago
Convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing...
IGARSS
2010
13 years 2 months ago
Minimum volume simplicial enclosure for spectral unmixing of remotely sensed hyperspectral data
Spectral unmixing is an important task for remotely sensed hyperspectral data exploitation. Linear spectral unmixing relies on two main steps: 1) identification of pure spectral c...
Eligius M. T. Hendrix, Inmaculada García, J...