Paper
9 April 2007 Object detection in hyperspectral imagery by using K-means clustering algorithm with pre-processing
M. S. Alam, M. I. Elbakary, M. S. Aslan
Author Affiliations +
Abstract
K-means clustering method has been employed in different applications of data analysis. This paper develops a target detection system using the k-means algorithm including a preprocessing step based on the Euclidean distance. The pre-processing step reduces the computational complexity of the k-means algorithm in case of hyperspectral imagery. After reducing the set of pixels in the background from the data by using the pre-processing step, k-means algorithm is employed to determine the clusters in rest of the image data cube. Having obtained the clustered data, the objects of interest can easily be detected using the known target signature. The proposed clustering algorithm is successfully applied to the real life hyperspectral data sets where the objects of interest can efficiently be detected. The proposed scheme effectively reduces the convergence time of the k-mean algorithm compared to that required by the traditional k-means algorithm.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
M. S. Alam, M. I. Elbakary, and M. S. Aslan "Object detection in hyperspectral imagery by using K-means clustering algorithm with pre-processing", Proc. SPIE 6574, Optical Pattern Recognition XVIII, 65740M (9 April 2007); https://doi.org/10.1117/12.717926
Lens.org Logo
CITATIONS
Cited by 8 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Hyperspectral imaging

Target detection

Hyperspectral target detection

Algorithm development

Data analysis

Machine learning

Back to Top