A multi-level thresholding image segmentation algorithm based on equilibrium optimizer

Multi-level thresholding for image segmentation is one of the key techniques in image processing. Although numerous methods have been introduced, it remains challenging to achieve stable and satisfactory thresholds when segmenting images with various unknown properties. This paper proposes an equili...

Full description

Saved in:
Bibliographic Details
Published in:Scientific reports Vol. 14; no. 1; pp. 29728 - 16
Main Authors: Hu, Pei, Han, Yibo, Zhang, Zheng, Chu, Shu-Chuan, Pan, Jeng-Shyang
Format: Journal Article
Language:English
Published: London Nature Publishing Group UK 29.11.2024
Nature Publishing Group
Nature Portfolio
Subjects:
ISSN:2045-2322, 2045-2322
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multi-level thresholding for image segmentation is one of the key techniques in image processing. Although numerous methods have been introduced, it remains challenging to achieve stable and satisfactory thresholds when segmenting images with various unknown properties. This paper proposes an equilibrium optimizer algorithm to find the optimal multi-level thresholds for grayscale images. The proposed algorithm AEO (advanced equilibrium optimizer) uses two sub-populations to balance exploration and exploitation during the multi-level threshold search process. Two mutation schemes are proposed for the sub-populations to prevent them from being trapped in local optima. AEO offers a repair function to avoid generating duplicate thresholds. The performance of AEO is evaluated on multiple benchmark images. Experimental results demonstrate that AEO has an outstanding ability for multi-level threshold image segmentation in terms of cross-entropy, signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and feature similarity index (FSIM).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-024-81075-w