NDLI: Clustering based band selection for endmember extraction using simplex growing algorithm in hyperspectral images

Content Provider	Springer Nature Link
Copyright Year	2016
Abstract	With the advancement in technology, hyperspectral images have potential applications in the field of remote sensing due to their high spectral resolution. Despite the hyperspectral image providing abundant information, its analysis suffers from the problem of high dimensionality. Hence, Dimensionality Reduction (DR) is an essential task in all hyperspectral image analysis. Band Selection, which is one of the DR techniques, is still a challenging issue even though many algorithms have been developed. To provide remedy for this issue, this paper explores a novel approach for band selection using K-means clustering on statistical feature in hyperspectral images. The proposed method of clustering based band selection for DR is simple and accurate. A reliable estimate of number of bands to be selected is provided by Virtual Dimensionality (VD). Informative bands preserving maximum information are selected based on the statistical feature, the variance using K-means Clustering technique. Further, our proposed work involves the utilization of the effectiveness of Simplex Growing Algorithm (SGA) on endmember extraction in association with clustering based band selection. Using Fully Constrained Least Squares (FCLS) method, abundance fraction is estimated based on endmember signatures, which are derived using Endmember Extraction Algorithm (EEA). The proposed work is investigated and compared with that of N-FINDR and Vertex Component Analysis (VCA) algorithms. The performance of the proposed algorithm is evaluated using Root Mean Square Error (RMSE), Spectral Angle Distance (SAD) and computation time. Experimental results show that the proposed clustering based band selection with SGA endmember extraction algorithm reduces the average SAD by 8 to 10 % and the average RMSE by nearly 1 %, compared to that of N-FINDR and VCA algorithms. In terms of computation time, the proposed band selection based DR with SGA algorithm is seven times faster than conventional transform based DR with SGA algorithm.
Starting Page	8355
Ending Page	8371
Page Count	17
File Format	PDF
ISSN	13807501
Journal	Multimedia Tools and Applications
Volume Number	76
Issue Number	6
e-ISSN	15737721
Language	English
Publisher	Springer US
Publisher Date	2016-04-02
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Dimensionality reduction Virtual dimensionality Band selection K-means Endmember extraction SGA FCLS Multimedia Information Systems Computer Communication Networks Data Structures, Cryptology and Information Theory Special Purpose and Application-Based Systems
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software Media Technology

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A New Growing Method for Simplex-Based Endmember Extraction Algorithm

Field-Programmable Gate Array Design of Implementing Simplex Growing Algorithm for Hyperspectral Endmember Extraction

Fast Implementation of Maximum Simplex Volume-Based Endmember Extraction in Original Hyperspectral Data Space

Dimensionality reduction of hyperspectral image data using band clustering and selection through k-means based on statistical characteristics of band images.

Real-time processing of simplex growing algorithm

Introducing co-clustering for hyperspectral image analysis

Real-Time Simplex Growing Algorithms for Hyperspectral Endmember Extraction

Recognition and localization of occluded apples using K-means clustering algorithm and convex hull theory: a comparison

Optimal subspace dimensionality for k-nearest-neighbor queries on clustered and dimensionality reduced datasets with SVD

Clustering based band selection for endmember extraction using simplex growing algorithm in hyperspectral images

Similar Documents

A New Growing Method for Simplex-Based Endmember Extraction Algorithm

Field-Programmable Gate Array Design of Implementing Simplex Growing Algorithm for Hyperspectral Endmember Extraction

Fast Implementation of Maximum Simplex Volume-Based Endmember Extraction in Original Hyperspectral Data Space

Dimensionality reduction of hyperspectral image data using band clustering and selection through k-means based on statistical characteristics of band images.

Real-time processing of simplex growing algorithm

Introducing co-clustering for hyperspectral image analysis

Real-Time Simplex Growing Algorithms for Hyperspectral Endmember Extraction

Recognition and localization of occluded apples using K-means clustering algorithm and convex hull theory: a comparison

Optimal subspace dimensionality for k-nearest-neighbor queries on clustered and dimensionality reduced datasets with SVD

Clustering based band selection for endmember extraction using simplex growing algorithm in hyperspectral images