By Topic

Hyperspectral Image Unmixing via Alternating Projected Subgradients

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zymnis, A. ; Stanford Univ., Stanford ; Kim, S.J. ; Skaf, J. ; Parente, M.
more authors

We consider the problem of factorizing a hyperspectral image into the product of two nonnegative matrices, which represent nonnegative bases for image spectra and mixing coefficients, respectively. This spectral unmixing problem is a nonconvex optimization problem, which is very difficult to solve exactly. We present a simple heuristic for approximately solving this problem based on the idea of alternating projected subgradient descent. Finally, we present the results of applying this method on the 1990 AVIRIS image of Cuprite, Nevada and show that our results are in agreement with similar studies on the same data.

Published in:

Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on

Date of Conference:

4-7 Nov. 2007