.png){kind=icon}
.png){kind=icon}
Return
A mean shift segmentation scheme using several pixel characteristics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2021.107022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new segmentation method based on the mean shift (MS) algorithm is presented. The proposed approach divides the image into two sets of pixels: operative elements and inactive elements. In its first phase, the MS scheme considers only the operative elements. In its second stage, the results obtained by the MS method with the operative data are used to include the inactive data. During this stage, each inactive pixel is assigned to the cluster corresponding to the nearest operative pixel. As a final operation, clusters that maintain the minimal number of elements are blended with other nearby clusters. Our method has been tested against other current segmentation methods using test images extracted from the Berkley dataset. Numerical experiments demonstrate that our approach exhibits better performance in terms of consistency, quality, velocity and accuracy.
Keywords:
Segmentation algorithm
Mean shift method
Non-local mean
Kernel density estimator (KDE)
Clustering methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W