Multilevel Color Image Segmentation Based on GLCM and Improved Salp Swarm Algorithm

81Citations
Citations of this article
59Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The grayscale co-occurrence matrix (GLCM) can be adapted to segment the image according to the pixels, but the segmentation effect becomes worse as the number of threshold increases. To solve this problem, we propose an improved salp swarm algorithm (LSSA) to optimize GLCM, with the novel diagonal class entropy (DCE) as the fitness function of the GLCM algorithm. At the same time, in order to increase the optimization ability of traditional SSA algorithm, Levy flight (LF) strategy should be improved. Through experiments on the LSSA algorithm of the color natural images, the satellite images, and the Berkeley images, the segmentation quality of the segmented images is evaluated by peak signal-to-noise ratio, feature similarity, probability rand index, variation of information, global consistency error, and boundary displacement error. The experimental results show that the segmentation ability of the GLCM-LSSA algorithm is superior to other comparison algorithms and has a good segmentation ability.

Cite

CITATION STYLE

APA

Xing, Z., & Jia, H. (2019). Multilevel Color Image Segmentation Based on GLCM and Improved Salp Swarm Algorithm. IEEE Access, 7, 37672–37690. https://doi.org/10.1109/ACCESS.2019.2904511

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free