Minimax Bridgeness-Based Clustering for Hyperspectral Data
Open Access
- 4 April 2020
- journal article
- letter
- Published by MDPI AG in Remote Sensing
- Vol. 12 (7) , 1162
Abstract
Hyperspectral (HS) imaging has been used extensively in remote sensing applications like agriculture, forestry, geology and marine science. HS pixel classification is an important task to help identify different classes of materials within a scene, such as different types of crops on a farm. However, this task is significantly hindered by the fact that HS pixels typically form high-dimensional clusters of arbitrary sizes and shapes in the feature space spanned by all spectral channels. This is even more of a challenge when ground truth data is difficult to obtain and when there is no reliable prior information about these clusters (e.g., number, typical shape, intrinsic dimensionality). In this letter, we present a new graph-based clustering approach for hyperspectral data mining that does not require ground truth data nor parameter tuning. It is based on the minimax distance, a measure of similarity between vertices on a graph. Using the silhouette index, we demonstrate that the minimax distance is more suitable to identify clusters in raw hyperspectral data than two other graph-based similarity measures: mutual proximity and shared nearest neighbours. We then introduce the minimax bridgeness-based clustering approach, and we demonstrate that it can discover clusters of interest in hyperspectral data better than comparable approaches.Keywords
This publication has 45 references indexed in Scilit:
- Nitrogen Status Assessment for Variable Rate Fertilization in Maize through Hyperspectral ImageryRemote Sensing, 2014
- Clustering by fast search and find of density peaksScience, 2014
- Multivariate Density Estimation by Bayesian Sequential PartitioningJournal of the American Statistical Association, 2013
- Kernel density estimation via diffusionThe Annals of Statistics, 2010
- KNN-kernel density-based clustering for high-dimensional multivariate dataComputational Statistics & Data Analysis, 2006
- Mean shift: a robust approach toward feature space analysisIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- An optimal minimum spanning tree algorithmJournal of the ACM, 2002
- The estimation of the gradient of a density function, with applications in pattern recognitionIEEE Transactions on Information Theory, 1975
- A Nonparametric Estimate of a Multivariate Density FunctionThe Annals of Mathematical Statistics, 1965
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955