Extending K-means to Preserve Spatial Connectivity

Sampriti Soor (1) , Aditya Challa (1) , Sravan Danda (1) , B S Daya Sagar (1) , Laurent Najman (2)

1 Systems Science and Informatics Unit
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

Clustering is one of the most important steps in the data processing pipeline. Of all the clustering techniques, perhaps the most widely used technique is K-Means. However, K-Means does not necessarily result in clusters which are spatially connected and hence the technique remains unusable for several remote sensing, geoscience and geographic information science (GISci) data. In this article, we propose an extension of K-Means algorithm which results in spatially connected clusters. We empirically verify that this indeed is true and use the proposed algorithm to obtain most significant group of wa-terbodies mapped from multispectral image acquired by IRS LISS-III satellite.

Mots clés: Clustering; Graphs; K-Means

Domaines: Apprentissage [cs.LG]

Sampriti Soor, Aditya Challa, Sravan Danda, B S Daya Sagar, Laurent Najman. Extending K-means to Preserve Spatial Connectivity. IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Jul 2018, Valencia, Spain. ⟨hal-01686321⟩