Dimensionality reduction of hyperspectral imagery using improved locally linear embedding

Guangyi Chen; Shen-En Qian

doi:10.1117/1.2723663

1 March 2007 Dimensionality reduction of hyperspectral imagery

Guangyi Chen, Shen-En Qian

Author Affiliations +

Journal of Applied Remote Sensing, Vol. 1, Issue 1, 013509 (March 2007). https://doi.org/10.1117/1.2723663

Abstract

In this paper, we study the Locally Linear Embedding (LLE) for nonlinear dimensionality reduction of hyperspectral data. We improve the existing LLE in terms of both computational complexity and memory consumption by introducing a spatial neighbourhood window for calculating the k nearest neighbours. The improved LLE can process larger hyperspectral images than the existing LLE and it is also faster. We conducted experiments of endmember extraction to assess the effectiveness of the dimensionality reduction methods. Experimental results show that the improved LLE is better than PCA and the existing LLE in identifying endmembers. It finds more endmembers than PCA and the existing LLE when the Pixel Purity Index (PPI) based endmember extraction method is used. Also, better results are obtained for detection.

Citation Download Citation

Guangyi Chen and Shen-En Qian "Dimensionality reduction of hyperspectral imagery," Journal of Applied Remote Sensing 1(1), 013509 (1 March 2007). https://doi.org/10.1117/1.2723663

Published: 1 March 2007

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available