Probabilistic unsupervised classification for large-scale analysis of spectral imaging data

Abstract

Land cover classification of remote sensing data is a fundamental tool to study changes in the environment such as deforestation or wildfires. A current challenge is to quantify land cover changes with real-time, large-scale data from modern hyper- or multispectral sensors. A range of methods are available for this task, several of them being based on the k-means classification method which is efficient when classes of land cover are well separated. Here a new algorithm, called probabilistic k-means, is presented to solve some of the limitations of the standard k-means. It is shown that the new algorithm performs better than the standard k-means when the data are noisy. If the number of land cover classes is unknown, an entropy-based criterion can be used to select the best number of classes. The proposed new algorithm is implemented in a combination of R and C computer codes which is particularly efficient with large data sets: a whole image with more than 3 million pixels and covering more than 10,000 km2 can be analysed in a few minutes. Four applications with hyperspectral and multispectral data are presented. For the data sets with ground truth data, the overall accuracy of the probabilistic k-means was substantially improved compared to the standard k-means. One of these data sets includes more than 120 million pixels, demonstrating the scalability of the proposed approach. These developments open new perspectives for the large scale analysis of remote sensing data. All computer code are available in an open-source package called sentinel.

Keywords

• Unsupervised classification
• k-means
• Land cover
• Multivariate normal density
• Spectral imaging data