ArticleEntropy (Basel, Switzerland)2023
Multi-Level Thresholding Image Segmentation Based on Improved Slime Mould Algorithm and Symmetric Cross-Entropy.
Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
6 citing papers in PubMed.
- An Adaptive Hybrid Metaheuristic Algorithm for Lung Cancer in Pathological Image Segmentation.Diagnostics (Basel, Switzerland) · 2025Article
- Multilevel thresholding of color images using globally informed artificial bee colony algorithm.Scientific reports · 2025Article
- A multi-level thresholding image segmentation algorithm based on equilibrium optimizer.Scientific reports · 2024Article
- Advances in Slime Mould Algorithm: A Comprehensive Survey.Biomimetics (Basel, Switzerland) · 2024Review
- Implementation of Chaotic Reverse Slime Mould Algorithm Based on the Dandelion Optimizer.Biomimetics (Basel, Switzerland) · 2023Article
- Symmetric cross-entropy multi-threshold color image segmentation based on improved pelican optimization algorithm.PloS one · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
Multi-level thresholding image segmentation divides an image into multiple regions of interest and is a key step in image processing and image analysis. Aiming toward the problems of the low segmentation accuracy and slow convergence speed of traditional multi-level threshold image segmentation methods, in this paper, we present multi-level thresholding image segmentation based on an improved slime mould algorithm (ISMA) and symmetric cross-entropy for global optimization and image segmentation tasks. First, elite opposition-based learning (EOBL) was used to improve the quality and diversity of the initial population and accelerate the convergence speed. The adaptive probability threshold was used to adjust the selection probability of the slime mould to enhance the ability of the algorithm to jump out of the local optimum. The historical leader strategy, which selects the optimal historical information as the leader for the position update, was found to improve the convergence accuracy. Subsequently, 14 benchmark functions were used to evaluate the performance of ISMA, comparing it with other well-known algorithms in terms of the optimization accuracy, convergence speed, and significant differences. Subsequently, we tested the segmentation quality of the method proposed in this paper on eight grayscale images and compared it with other image segmentation criteria and well-known algorithms. The experimental metrics include the average fitness (mean), standard deviation (std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), and feature similarity index (FSIM), which we utilized to evaluate the quality of the segmentation. The experimental results demonstrated that the improved slime mould algorithm is superior to the other compared algorithms, and multi-level thresholding image segmentation based on the improved slime mould algorithm and symmetric cross-entropy can be effectively applied to the task of multi-level threshold image segmentation.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.