Comparison of Two Algorithms for Land Cover Mapping Based on Hyperspectral Imagery
Main Article Content
Abstract
This paper presents an analysis of hyperspectral image data carried out using two approaches followed with a comparison of the two. The hyperspectral image dataset used for analysis, corresponds to a strip along the North Eastern region of Sri Lanka, obtained by the Earth Observing (EO-1) satellite’s Hyperion sensor. Mapping land-cover using hyperspectral imagery makes it possible to obtain finer details of land otherwise not possible if RGB images are used. Therefore, it could be used as a basis to obtain useful information for natural resource location and ecosystem service management, assessing the human induced and natural drivers of changes in land, foliage or water bodies and even in identification of fine details such as the distribution of minerals in an area before doing a ground survey.
The two algorithms discussed in this paper, initially represents each pixel as a point in a high dimensional space of which the dimensions represent each band of wavelength and subsequently follows two unique approaches to cluster the points (pixels) in a reduced dimensional space. The first of the algorithms discussed in this paper, employs Principal Component Analysis (PCA), Fisher Discriminant Analysis (FDA) and Spectral Clustering were used in a logical sequence, while the second uses PCA along with concepts of Euclidean geometry. The pixels belonging to each cluster were labeled under ‘soil’, ‘foliage’ or ‘water bodies’, with the aid of the k-means algorithm and the hyperspectral data of the training set obtained with the aid of Google Maps. The classification follows a comparison of the two approaches employed. Conclusively, the two approaches discussed have their own pros and cons, whilst providing promising results, and hence could be used appropriately based on the application.
The two algorithms discussed in this paper, initially represents each pixel as a point in a high dimensional space of which the dimensions represent each band of wavelength and subsequently follows two unique approaches to cluster the points (pixels) in a reduced dimensional space. The first of the algorithms discussed in this paper, employs Principal Component Analysis (PCA), Fisher Discriminant Analysis (FDA) and Spectral Clustering were used in a logical sequence, while the second uses PCA along with concepts of Euclidean geometry. The pixels belonging to each cluster were labeled under ‘soil’, ‘foliage’ or ‘water bodies’, with the aid of the k-means algorithm and the hyperspectral data of the training set obtained with the aid of Google Maps. The classification follows a comparison of the two approaches employed. Conclusively, the two approaches discussed have their own pros and cons, whilst providing promising results, and hence could be used appropriately based on the application.
Article Details
Issue
Select the Journal Issue
Articles