Evidence map›Paper›PMID 40920762›Full record

ArticlePloS one2025

An enhanced secretary bird optimization algorithm based on precise elimination mechanism and boundary control for numerical optimization and low-light image enhancement.

Yuqi Xiong

Abstract read
In one paragraph

Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Yuqi XiongSchool of Computer Science and Engineering, Southeast University, China.ORCID https://orcid.org/0009-0003-1211-6000

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Metaheuristic optimization algorithms often face challenges such as complex modeling, limited adaptability, and a tendency to get trapped in local optima when solving complex optimization problems. To enhance algorithm performance, this paper proposes an enhanced Secretary Bird Optimization Algorithm (MESBOA) based on a precise elimination mechanism and boundary control. The algorithm integrates three key strategies: a precise population elimination strategy, which optimizes the population structure by eliminating individuals with low fitness and intelligently generating new ones; a lens imaging-based opposition learning strategy, which expands the exploration of the solution space through reflection and scaling to reduce the risk of local optima; and a boundary control strategy based on the best individual, which effectively constrains the search range to avoid inefficient searches and premature convergence. Experimental validation shows that on 23 benchmark functions and the CEC2022 test suite, MESBOA significantly outperforms the original Secretary Bird Optimization Algorithm (SBOA) and other comparative algorithms (such as GWO, WOA, PSO, etc.) in terms of convergence speed, solution accuracy, and stability. Taking low-light image enhancement as an application case, MESBOA performs better in metrics such as Mean Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR), and Structural Similarity Index (SSIM) by optimizing the parameters of the normalized incomplete Beta function, verifying its effectiveness in practical problems. The research indicates that MESBOA provides an efficient solution for complex optimization tasks and has the potential to be promoted and applied in multiple fields.

Indexed as

AlgorithmsImage EnhancementImage Processing, Computer-AssistedBirdsModels, Theoretical

Identifiers

PMID40920762
PMCPMC12416714

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.