Abstract

Change detection of hyperspectral images is a very important subject in the field of remote sensing application. Due to the large number of bands and the high correlation between adjacent bands in the hyperspectral image cube, information redundancy is a big problem, which increases the computational complexity and brings negative factor to detection performance. To address this problem, the principal component analysis (PCA) has been widely used for dimension reduction. It has the capability of projecting the original multi-dimensional hyperspectral data into new eigenvector space which allows it to extract light but representative information. The difference image of the PCA components is obtained by subtracting the two dimensionality-reduced images, on which the change detection is considered as a binary classification problem. The first several principal components of each pixel are taken as a feature vector for data classification using k-means clustering with k=2, where the two classes are changed pixels and unchanged pixels, respectively. The centroids of two clusters are determined by iteratively finding the minimum Euclidean distance between pixel’s eigenvectors. Experiments on two publicly available datasets have been carried out and evaluated by overall accuracy. The results have validated the efficacy and efficiency of the proposed approach.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call