Balancing Accuracy and Efficiency: A Comprehensive Analysis of Optimization Algorithms in Medical Image Segmentation

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract Medical image segmentation algorithms play a crucial role in assisting healthcare professionals with disease identification, research, and diagnosis. Numerous digital image segmentation methods have been developed, with multilevel thresholding techniques consistently outperforming others in terms of evaluation metrics. The standard algorithms include classical statistical methods, such as the Otsu and Kapur methods, which yield highly accurate results. However, when applied to multilevel thresholding, these methods incur significant computational costs, presenting an optimization challenge. In this work, a set of well-known optimization algorithms is integrated with Otsu’s method to assess their effectiveness in reducing computational demands while preserving optimal segmentation quality. Experiments are conducted on publicly available datasets, including chest images with associated clinical and genomic data. This work evaluates the performance of each optimization algorithm in combination with Otsu's method, highlighting those that achieve substantial reductions in computational cost and convergence time while maintaining a competitive level of segmentation quality.
Full text 13,335 characters · extracted from preprint-html · click to expand
Balancing Accuracy and Efficiency: A Comprehensive Analysis of Optimization Algorithms in Medical Image Segmentation | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Balancing Accuracy and Efficiency: A Comprehensive Analysis of Optimization Algorithms in Medical Image Segmentation Nijad A. Al-Najdawi, Ali F. Al-Shawabkeh, Sara Tedmori, Ibrahim I. Ikhries, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6507057/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 24 Oct, 2025 Read the published version in Scientific Reports → Version 1 posted 9 You are reading this latest preprint version Abstract Medical image segmentation algorithms play a crucial role in assisting healthcare professionals with disease identification, research, and diagnosis. Numerous digital image segmentation methods have been developed, with multilevel thresholding techniques consistently outperforming others in terms of evaluation metrics. The standard algorithms include classical statistical methods, such as the Otsu and Kapur methods, which yield highly accurate results. However, when applied to multilevel thresholding, these methods incur significant computational costs, presenting an optimization challenge. In this work, a set of well-known optimization algorithms is integrated with Otsu’s method to assess their effectiveness in reducing computational demands while preserving optimal segmentation quality. Experiments are conducted on publicly available datasets, including chest images with associated clinical and genomic data. This work evaluates the performance of each optimization algorithm in combination with Otsu's method, highlighting those that achieve substantial reductions in computational cost and convergence time while maintaining a competitive level of segmentation quality. Biological sciences/Cancer Biological sciences/Computational biology and bioinformatics Physical sciences/Engineering Medical images segmentation optimization algorithms Multi-level Thresholding computational efficiency Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 24 Oct, 2025 Read the published version in Scientific Reports → Version 1 posted Reviewers agreed at journal 19 May, 2025 Reviews received at journal 18 May, 2025 Reviewers agreed at journal 15 May, 2025 Reviewers agreed at journal 15 May, 2025 Reviewers invited by journal 15 May, 2025 Editor assigned by journal 12 May, 2025 Editor invited by journal 12 May, 2025 Submission checks completed at journal 12 May, 2025 First submitted to journal 22 Apr, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6507057","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":458800538,"identity":"e52c5e17-db3f-4f88-9222-4b3fa65692b1","order_by":0,"name":"Nijad A. Al-Najdawi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABAklEQVRIiWNgGAWjYHACxgNAgpkBSB742AAWMWBg4MGvB67l4ExStIBJZl64FjzAnIH5wQHGHXbsfMfPGB623WGX2MDevE2CQcYGpxbLBjaDA4xnkpklz+QYHM49k5zYwHOsTIKBJw2nFoMDDAaH/7YxMxscyN1wOLeNObFBIscMqOUwHi3sHw4wttUzG5x/u+GwZVt9YoP8G0JaeIAOazvMbHADaAuQAbSFh4CWwzwFQC3HmSVvvP9wsPfMceM2nrRiiwR8fjnevvEBY1t1Mt/5tOQPP3dUy/azH95442MP7hADxiEYJMMF2EBEYg9uHTBgh8b/QVjLKBgFo2AUjBgAAOiVV17UXaDqAAAAAElFTkSuQmCC","orcid":"","institution":"Al-Balqa Applied University","correspondingAuthor":true,"prefix":"","firstName":"Nijad","middleName":"A.","lastName":"Al-Najdawi","suffix":""},{"id":458800539,"identity":"d3d79652-b49f-46eb-869b-356612ab3c52","order_by":1,"name":"Ali F. Al-Shawabkeh","email":"","orcid":"","institution":"Al-Balqa Applied University","correspondingAuthor":false,"prefix":"","firstName":"Ali","middleName":"F.","lastName":"Al-Shawabkeh","suffix":""},{"id":458800540,"identity":"e739d0b4-e3de-415b-8116-24f1de979fef","order_by":2,"name":"Sara Tedmori","email":"","orcid":"","institution":"Princess Sumaya University for Technology","correspondingAuthor":false,"prefix":"","firstName":"Sara","middleName":"","lastName":"Tedmori","suffix":""},{"id":458800541,"identity":"da0d561b-2cb9-4b0c-b498-94eec5272ce7","order_by":3,"name":"Ibrahim I. Ikhries","email":"","orcid":"","institution":"Al-Balqa Applied University","correspondingAuthor":false,"prefix":"","firstName":"Ibrahim","middleName":"I.","lastName":"Ikhries","suffix":""},{"id":458800542,"identity":"77d62fac-a26a-4eb4-8c0b-027e82317652","order_by":4,"name":"Osama Dorgham","email":"","orcid":"","institution":"Al-Balqa Applied University","correspondingAuthor":false,"prefix":"","firstName":"Osama","middleName":"","lastName":"Dorgham","suffix":""}],"badges":[],"createdAt":"2025-04-22 19:53:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6507057/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6507057/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-025-14261-z","type":"published","date":"2025-10-24T16:16:10+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":94490211,"identity":"1b49c50e-b6cd-4e0a-aac3-ec25b0ab2e41","added_by":"auto","created_at":"2025-10-27 17:08:13","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1363859,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptFinal.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6507057/v1_covered_51c25816-52c2-42ac-ad82-fb69a5c76a3e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Balancing Accuracy and Efficiency: A Comprehensive Analysis of Optimization Algorithms in Medical Image Segmentation","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Medical images, segmentation, optimization algorithms, Multi-level Thresholding, computational efficiency","lastPublishedDoi":"10.21203/rs.3.rs-6507057/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6507057/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eMedical image segmentation algorithms play a crucial role in assisting healthcare professionals with disease identification, research, and diagnosis. Numerous digital image segmentation methods have been developed, with multilevel thresholding techniques consistently outperforming others in terms of evaluation metrics. The standard algorithms include classical statistical methods, such as the Otsu and Kapur methods, which yield highly accurate results. However, when applied to multilevel thresholding, these methods incur significant computational costs, presenting an optimization challenge. In this work, a set of well-known optimization algorithms is integrated with Otsu\u0026rsquo;s method to assess their effectiveness in reducing computational demands while preserving optimal segmentation quality. Experiments are conducted on publicly available datasets, including chest images with associated clinical and genomic data. This work evaluates the performance of each optimization algorithm in combination with Otsu's method, highlighting those that achieve substantial reductions in computational cost and convergence time while maintaining a competitive level of segmentation quality.\u003c/p\u003e","manuscriptTitle":"Balancing Accuracy and Efficiency: A Comprehensive Analysis of Optimization Algorithms in Medical Image Segmentation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-05-20 08:00:57","doi":"10.21203/rs.3.rs-6507057/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"reviewerAgreed","content":"201654236664472209120281031224413888403","date":"2025-05-19T14:22:15+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-05-18T19:53:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"90427517554143109735338867455507842691","date":"2025-05-16T02:44:24+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"93760328051477065205540047507870938563","date":"2025-05-15T19:16:19+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-05-15T18:27:18+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-05-12T18:12:55+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2025-05-12T08:19:12+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-05-12T07:25:34+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2025-04-22T19:50:56+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"b4100a0c-9a19-4999-8882-9d05a53d049d","owner":[],"postedDate":"May 20th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":48739794,"name":"Biological sciences/Cancer"},{"id":48739795,"name":"Biological sciences/Computational biology and bioinformatics"},{"id":48739796,"name":"Physical sciences/Engineering"}],"tags":[],"updatedAt":"2025-10-27T16:22:14+00:00","versionOfRecord":{"articleIdentity":"rs-6507057","link":"https://doi.org/10.1038/s41598-025-14261-z","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2025-10-24 16:16:10","publishedOnDateReadable":"October 24th, 2025"},"versionCreatedAt":"2025-05-20 08:00:57","video":"","vorDoi":"10.1038/s41598-025-14261-z","vorDoiUrl":"https://doi.org/10.1038/s41598-025-14261-z","workflowStages":[]},"version":"v1","identity":"rs-6507057","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6507057","identity":"rs-6507057","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0