By Topic

Sequential and Parallel Feature Extraction in Hyperspectral Data Using Nonnegative Matrix Factorization

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

2 Author(s)
Stefan A. Robila ; Department of Computer Science at Montclair State University, Montclair, NJ 07043, USA, phone: 973-655-4230, fax: 973-655-4164, email: ; Lukasz G. Maciak

Feature extraction refers to the groups of techniques that, when applied to large dimensional and redundant data result in significant dimensionality reduction while preserving or even enhancing the information content. Among various techniques investigated for feature extraction, of new interest is nonnegative matrix factorization (NMF). In NMF, it is assumed that the data is formed as a linear nonnegative combination of positive sources and the NMF solution recovers the original sources and the mixing matrix. In this paper, we first look at ways NMF can be applied for feature extraction in hyperspectral imagery a data known for large sizes and redundancy. While some of the associations are natural to linear mixing model (LMM - that assumes that hyperspectral images are formed as a linear mixture of endmember information), we also show NMF to be a slow method. To counter this, we investigate alternative solutions such as projected NMF approaches and provide an insight to how parallel implementations would contribute to speedup. Experimental results on various data show projected NMF outperforming regular NMF with parallel implementations providing a promising speedup advantage.

Published in:

Systems, Applications and Technology Conference, 2007. LISAT 2007. IEEE Long Island

Date of Conference:

4-4 May 2007