4.7 Article

Adaptive Distance-Weighted Voronoi Tessellation for Remote Sensing Image Segmentation

Journal

REMOTE SENSING
Volume 12, Issue 24, Pages -

Publisher

MDPI
DOI: 10.3390/rs12244115

Keywords

adaptive distance-weighted; Voronoi tessellation; Markov Random Field (MRF); Kullback– Leibler (KL) entropy; fuzzy clustering; remote sensing image segmentation

Funding

  1. Strategic Priority Research Program of the Chinese Academy of Sciences [XDA19030301]
  2. National Natural Science Foundation of China [42001286, 41801360, 41771403, 41801358]

Ask authors/readers for more resources

The spatial fragmentation of high-resolution remote sensing images makes the segmentation algorithm put forward a strong demand for noise immunity. However, the stronger the noise immunity, the more serious the loss of detailed information, which easily leads to the neglect of effective characteristics. In view of the difficulty of balancing the noise immunity and effective characteristic retention, an adaptive distance-weighted Voronoi tessellation technology is proposed for remote sensing image segmentation. The distance between pixels and seed points in Voronoi tessellation is established by the adaptive weighting of spatial distance and spectral distance. The weight coefficient used to control the influence intensity of spatial distance is defined by a monotone decreasing function. Following the fuzzy clustering framework, a fuzzy segmentation model with Kullback-Leibler (KL) entropy regularization is established by using multivariate Gaussian distribution to describe the spectral characteristics and Markov Random Field (MRF) to consider the neighborhood effect of sub-regions. Finally, a series of parameter optimization schemes are designed according to parameter characteristics to obtain the optimal segmentation results. The proposed algorithm is validated on many multispectral remote sensing images with five comparing algorithms by qualitative and quantitative analysis. A large number of experiments show that the proposed algorithm can overcome the complex noise as well as better ensure effective characteristics.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available