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.