Hierarchical and multiscale Mean Shift segmentation of population grid

Abstract : The Mean Shift (MS) algorithm allows to identify clusters that are catchment areas of modes of a probability density function (pdf). We propose to use a multiscale and hierarchical implementation of the algorithm to process grid data of population and identify automatically urban centers and their dependant sub-centers through scales. The multiscale structure is obtained by increasing iteratively the bandwidth of the kernel used to define the pdf on which the MS algorithm works. This will induce a hierarchical structure over clusters since modes will merge together when the bandwidth parameter increases.
Document type :
Conference papers
Complete list of metadatas

Contributor : Ifsttar Cadic <>
Submitted on : Wednesday, September 18, 2013 - 3:57:15 PM
Last modification on : Wednesday, April 11, 2018 - 12:10:02 PM


  • HAL Id : hal-00863318, version 1



Johanna Baro, Etienne Come, Patrice Aknin, Olivier Bonin. Hierarchical and multiscale Mean Shift segmentation of population grid. 22th European Symposium on Artificial Neural Networks (ESANN 2013), Apr 2013, Belgium. 6p. ⟨hal-00863318⟩



Record views