Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 307

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy

Zhao, Dong, Liu, Lei, Yu, Fanhua, Heidari, Ali Asghar, Wang, Mingjing, Liang, Guoxi, Muhammad, Khan, Chen, Huiling·2021·Knowledge-Based Systems

Abstract

Abstract Although the continuous version of ant colony optimizer (ACOR) has been successfully applied to various problems, there is room to boost its stability and improve convergence speed and precision. In addition, it is prone to stagnation, which means it cannot step out of the local optimum (LO). To effectively mitigate these concerns, an improved method using a random spare strategy and chaotic intensification strategy is proposed. Also, its selection mechanism is enhanced in our research. Among the new components, the convergence speed is mainly boosted by using a random spare approach. To effectively augment the ability to step out of LO and to refine the convergence accuracy, the chaotic intensification strategy and improved selection mechanism are applied to ACOR. To better verify the effectiveness of the proposed method, a series of comparative experiments are conducted by using 30 benchmark functions. According to all experimental results, it is evident that the convergence rapidity and accuracy of the proposed method is better than other peers. In addition, it is observed that the capability of enhanced RCACO is more reliable than other techniques in stepping out of LO. Furthermore, an excellent multi-threshold image segmentation method is proposed in this paper. On this basis, image segmentation experiments at low threshold levels and high threshold levels are also respectively carried out. The experimental results also adequately disclose that the segmentation results of RCACO for both multi-threshold image segmentation at a low threshold level and high threshold level, are even more satisfactory compared to other studied algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.knosys.2020.106510

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 307

Metadata

Authors
Zhao, D., Liu, L., Yu, F., Heidari, A. A., Wang, M., Liang, G., Muhammad, K., & Chen, H.
Venue
Knowledge-Based Systems
Publisher
Elsevier BV
Published
2021-03
Volume
216
Pages
106510
ISSN
0950-7051 (ISSN-L)
OpenAlex
W3094536368
Cited by
307
References
4
FWCI
24.25
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy. https://app.cochat.ai/papers/10.1016/j.knosys.2020.106510
The paper
Zhao, D., Liu, L., Yu, F., Heidari, A. A., Wang, M., Liang, G., Muhammad, K., & Chen, H. (2021). Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2020.106510

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.