IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0333304.html

Adaptive and migration-enhanced tree seed algorithm for multi-threshold CT image segmentation and lung cancer recognition

Author

Listed:
  • Chenxi Li
  • Jianhua Jiang
  • Zhixing Ma
  • Zhilong Yu
  • Hao Li
  • Jiayi Liu
  • Lingna Li
  • Zhenhao Yu

Abstract

The Tree-Seed Algorithm (TSA) is a swarm intelligence algorithm inspired by the propagation relationship between trees and seeds. However, the original TSA is prone to premature convergence and becomes trapped in local optima when addressing high-dimensional, complex optimization problems, limiting its practical efficacy. To overcome these limitations, this paper proposes an Adaptive and Migration-enhanced Tree Seed Algorithm (AMTSA), which integrates three key mechanisms to significantly enhance performance in solving complex optimization tasks. First, to effectively evade local optima, an adaptive tree migration mechanism is designed to dynamically adjust the search step-size and direction based on individual fitness, thereby improving global exploration. Second, to enhance the algorithm’s adaptability and efficiency across different search stages, an adaptive seed generation strategy based on the dynamic Weibull distribution is introduced. This strategy enables flexible control over the number of seeds and promotes a balanced search throughout the solution space. Third, to mitigate convergence oscillations during the global search, a nonlinear step-size adjustment function inspired by the GBO algorithm is incorporated, which effectively improves convergence stability by responding to the iteration progress. Rigorous testing on the IEEE CEC 2014 benchmark functions demonstrates that AMTSA’s overall performance surpasses not only state-of-the-art optimizers like JADE and LSHADE but also recent TSA variants, including STSA, fb-TSA, and MTSA. To further validate its robustness in high-dimensional spaces, AMTSA was tested on 30 benchmark functions at 30, 50, and 100 dimensions. Results show that AMTSA ranked first in the number of functions optimized best and exhibited the fastest convergence speed among all compared algorithms. In a real-world application, AMTSA was employed to optimize multi-threshold segmentation for lung cancer CT images. The resulting AMTSA-SVM classification model achieved an accuracy of 89.5%, significantly outperforming models such as standard SVM (76.22%), DE-SVM (82%), GA-SVM (79.33%), TSA-SVM (84.44%), and JADE-SVM (89.12%). In conclusion, the proposed AMTSA, by integrating adaptive migration, dynamic seed generation, and nonlinear step-size control, successfully addresses the inherent deficiencies of the native TSA, offering a more efficient and robust tool for solving high-dimensional, complex optimization problems. The AMTSA source code will be available at www.jianhuajiang.com.

Suggested Citation

  • Chenxi Li & Jianhua Jiang & Zhixing Ma & Zhilong Yu & Hao Li & Jiayi Liu & Lingna Li & Zhenhao Yu, 2026. "Adaptive and migration-enhanced tree seed algorithm for multi-threshold CT image segmentation and lung cancer recognition," PLOS ONE, Public Library of Science, vol. 21(1), pages 1-49, January.
  • Handle: RePEc:plo:pone00:0333304
    DOI: 10.1371/journal.pone.0333304
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0333304
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0333304&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0333304?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Robert E. Jensen, 1969. "A Dynamic Programming Algorithm for Cluster Analysis," Operations Research, INFORMS, vol. 17(6), pages 1034-1057, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Soheil Sadi-Nezhad & Kaveh Khalili-Damghani & Ameneh Norouzi, 2015. "A new fuzzy clustering algorithm based on multi-objective mathematical programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 168-197, April.
    2. Lau, Kin-nam & Leung, Pui-lam & Tse, Ka-kit, 1999. "A mathematical programming approach to clusterwise regression model and its extensions," European Journal of Operational Research, Elsevier, vol. 116(3), pages 640-652, August.
    3. Boctor, Fayez F. & Renaud, Jacques & Cornillier, Fabien, 2011. "Trip packing in petrol stations replenishment," Omega, Elsevier, vol. 39(1), pages 86-98, January.
    4. Alan Jessop, 2010. "An optimising approach to alternative clustering schemes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(3), pages 293-309, September.
    5. V. Choulakian, 2006. "Taxicab Correspondence Analysis," Psychometrika, Springer;The Psychometric Society, vol. 71(2), pages 333-345, June.
    6. Theodore M. Crone, 2004. "A redefinition of economic regions in the U.S," Working Papers 04-12, Federal Reserve Bank of Philadelphia.
    7. Vakharia, Asoo J. & Mahajan, Jayashree, 2000. "Clustering of objects and attributes for manufacturing and marketing applications," European Journal of Operational Research, Elsevier, vol. 123(3), pages 640-651, June.
    8. Theodore M. Crone, 2003. "An alternative definition of economic regions in the U.S. based on similarities in state business cycles," Working Papers 03-23, Federal Reserve Bank of Philadelphia.
    9. Cascón, J.M. & González-Arteaga, T. & de Andrés Calle, R., 2022. "A new preference classification approach: The λ-dissensus cluster algorithm," Omega, Elsevier, vol. 111(C).
    10. Bagirov, Adil M. & Yearwood, John, 2006. "A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems," European Journal of Operational Research, Elsevier, vol. 170(2), pages 578-596, April.
    11. A. Bagirov & B. Ordin & G. Ozturk & A. Xavier, 2015. "An incremental clustering algorithm based on hyperbolic smoothing," Computational Optimization and Applications, Springer, vol. 61(1), pages 219-241, May.
    12. Chiou, Yu-Chiun & Lan, Lawrence W., 2001. "Genetic clustering algorithms," European Journal of Operational Research, Elsevier, vol. 135(2), pages 413-427, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0333304. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.