A Region Competitive Level Set method with Error Corrected Code Output Multiclass SVM and Binary Arithmetic Optimization for Stroke Lesion 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 Research Article A Region Competitive Level Set method with Error Corrected Code Output Multiclass SVM and Binary Arithmetic Optimization for Stroke Lesion Segmentation senthil kumar thiyagarajan, kalpana murugan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7789831/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Stroke is one of the largest contributors to death and disability across the world. There is increasing demand for automation methods that detect and characterize different classes of stroke. Unsupervised region of interest extraction through clustering algorithms like K-means, Fuzzy C-means and their variants exhibits degradation when these algorithms go through image modalities with intensity inhomogeneity, noise and traps at local maximum. Active contour-based level set method is widely used in medical imaging as it accounts for fine-tuning the segmentation results from clustering approaches. These level set image segmentation methods fail in their evolution-convergence process when they are supplied with images having weak boundaries and a random initial contour over a fixed region of interest. These issues are addressed by our proposed Level set framework, which uses Error Correcting Code Output Multi Class Support Vector Machine for identifying stroke lesion group from the output of the FCM algorithm followed by region competition using binary arithmetic optimization-based pixel fitness detector for evolution and convergence of the level set. Encouraging Segmentation results are obtained in the proposed method with average values of 98.87% accuracy, 76.8% sensitivity, 83.1% Dice and 91.9% precision. Nuclear Medicine & Medical Imaging Artificial Intelligence and Machine Learning GM-Grey Matter WM-White Matter CSF-Cerebral Spinal Fluid ECCO-MC-SVM -Error Corrected Code Output Multi Class Support Vector Machines BAO-Binary Arithmetic Optimization MRI-Magnetic Resonance Image DWI-Diffusion Weighted Image ECCO-MC-SVM-BAO-RCLS - Error Corrected Code Output Multi Class Support Vector Machines and Binary Arithmetic Optimization based Region Competitive Level Set Ischemic Stroke Lesion Segmentation Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted 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-7789831","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":525268941,"identity":"64a0e7e5-7fdd-49b9-8271-81ac94d66fc1","order_by":0,"name":"senthil kumar thiyagarajan","email":"","orcid":"https://orcid.org/0000-0002-1508-6965","institution":"karpagam academy of higher education","correspondingAuthor":false,"prefix":"","firstName":"senthil","middleName":"kumar","lastName":"thiyagarajan","suffix":""},{"id":525269171,"identity":"50d18494-30cd-4896-ad72-139a9b0001de","order_by":1,"name":"kalpana murugan","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA8UlEQVRIiWNgGAWjYDCCAwzMDAwFMF4FEDMzNxChxQDGOwPSwkiKFsY2MIlfC9/t08kGPwzuyJuzHz744eO82mj+dqCWHxXbcGqRPJe7ObHH4Jnhzp60ZMmZ247nzjjM2MDYc+Y2Ti0GZ3g3H+AxOMy44UCOGTPvtmO5DUAtzIxt+LUc/GNw2H7D+fffmP/OOZY7nxgtyUBbEjfcyGEDhlVN7gZCWiSBWoxlDJ4lb7jxzFiy59iB3I1ALQfx+YUPqEXyTcUd2w3nkx9++FFTlzvv/OGDD35U4NYCBQdgjMOoXGK01BGheBSMglEwCkYaAAAUAmSo/lUCzQAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0002-5121-0468","institution":"kalasalingam academy of research and education","correspondingAuthor":true,"prefix":"","firstName":"kalpana","middleName":"","lastName":"murugan","suffix":""}],"badges":[],"createdAt":"2025-10-06 09:23:17","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-7789831/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7789831/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":92917710,"identity":"0f297342-8165-44d3-9bc6-d4b7cf800e07","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":258726,"visible":true,"origin":"","legend":"","description":"","filename":"ECCOMCSVMBAORCLSRSCOPY.docx","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/8a7a385f0535d43086cf489c.docx"},{"id":92917709,"identity":"1a7ddfee-7758-46f4-a2a8-a15eba49865e","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":342,"visible":true,"origin":"","legend":"","description":"","filename":"rs7789831.json","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/6a40f3a4b0ef5459e5883fdf.json"},{"id":92918464,"identity":"dc0b99dd-f474-4e5b-af22-35292d06c8e0","added_by":"auto","created_at":"2025-10-07 06:15:36","extension":"xml","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":118125,"visible":true,"origin":"","legend":"","description":"","filename":"rs77898310enriched.xml","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/7948e8a4e116d05038bd1d36.xml"},{"id":92917713,"identity":"461ea0e9-c872-4a92-a078-5b1370fd5c25","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"jpeg","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":268552,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage1.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/ed1e623e794c9a5aa8b29ea5.jpeg"},{"id":92917711,"identity":"cf7bf705-9159-4b55-8e31-4fe60a5740e6","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"jpeg","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":123184,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage2.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/6cfbd7fe0cb5765e35667474.jpeg"},{"id":92917716,"identity":"c44424e6-2f40-461e-9b13-1b687d82339f","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"jpeg","order_by":6,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":146559,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage3.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/b8951442fc6ab901911cabf2.jpeg"},{"id":92917721,"identity":"568e4e56-60d5-4399-8961-34d530fc4fb8","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"jpeg","order_by":7,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":167550,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage4.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/f7c62a6982797a4dce003d43.jpeg"},{"id":92917718,"identity":"ac7abb5a-23e2-4a11-89d1-b3c6f86a0e21","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"png","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":65505,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/c18514ca506ff6f6077894fc.png"},{"id":92917720,"identity":"f685633e-e5f2-4ed3-b75c-98c8b81ba62c","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"png","order_by":9,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":116727,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage2.png","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/06ae10595776cccefa160b12.png"},{"id":92917715,"identity":"bb80c2b8-ba88-4fc3-8996-124d950c8843","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"png","order_by":10,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":34680,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage3.png","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/c2eeaae016043832d5324b55.png"},{"id":92918465,"identity":"9ab0d166-1ff9-4c04-936d-86d4ef2a4c43","added_by":"auto","created_at":"2025-10-07 06:15:36","extension":"png","order_by":11,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":38917,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage4.png","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/4a175e538431eafb3b823ade.png"},{"id":92917717,"identity":"cd64274f-2bdb-4c9d-b102-dcef1dbb9fae","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"xml","order_by":12,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":117188,"visible":true,"origin":"","legend":"","description":"","filename":"rs77898310structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/d8a61109e6b958a1144668cf.xml"},{"id":92917719,"identity":"3f6f95ef-8ac5-4255-bd8c-48a6bbf90a0d","added_by":"auto","created_at":"2025-10-07 06:07:36","extension":"html","order_by":13,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":129034,"visible":true,"origin":"","legend":"","description":"","filename":"earlyproof.html","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1/f63e7da341c6543b23b93b42.html"},{"id":92918776,"identity":"e7a2c33c-3f27-4ebf-8b34-22eea461a09b","added_by":"auto","created_at":"2025-10-07 06:23:37","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":674669,"visible":true,"origin":"","legend":"","description":"","filename":"ECCOMCSVMBAORCLSRSCOPY.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7789831/v1_covered_38d593e2-163f-4519-ae90-7a68119ac179.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eA Region Competitive Level Set method with Error Corrected Code Output Multiclass SVM and Binary Arithmetic Optimization for Stroke Lesion Segmentation\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"GM-Grey Matter, WM-White Matter, CSF-Cerebral Spinal Fluid, ECCO-MC-SVM -Error Corrected Code Output Multi Class Support Vector Machines, BAO-Binary Arithmetic Optimization, MRI-Magnetic Resonance Image, DWI-Diffusion Weighted Image, ECCO-MC-SVM-BAO-RCLS - Error Corrected Code Output Multi Class Support Vector Machines and Binary Arithmetic Optimization based Region Competitive Level Set, Ischemic Stroke Lesion Segmentation","lastPublishedDoi":"10.21203/rs.3.rs-7789831/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7789831/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eStroke is one of the largest contributors to death and disability across the world. There is increasing demand for automation methods that detect and characterize different classes of stroke. Unsupervised region of interest extraction through clustering algorithms like K-means, Fuzzy C-means and their variants exhibits degradation when these algorithms go through image modalities with intensity inhomogeneity, noise and traps at local maximum. Active contour-based level set method is widely used in medical imaging as it accounts for fine-tuning the segmentation results from clustering approaches. These level set image segmentation methods fail in their evolution-convergence process when they are supplied with images having weak boundaries and a random initial contour over a fixed region of interest. These issues are addressed by our proposed Level set framework, which uses Error Correcting Code Output Multi Class Support Vector Machine for identifying stroke lesion group from the output of the FCM algorithm followed by region competition using binary arithmetic optimization-based pixel fitness detector for evolution and convergence of the level set. Encouraging Segmentation results are obtained in the proposed method with average values of 98.87% accuracy, 76.8% sensitivity, 83.1% Dice and 91.9% precision.\u003c/p\u003e","manuscriptTitle":"A Region Competitive Level Set method with Error Corrected Code Output Multiclass SVM and Binary Arithmetic Optimization for Stroke Lesion Segmentation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-07 06:07:31","doi":"10.21203/rs.3.rs-7789831/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6decb079-fe45-46d6-a209-f9bc2ab41f1f","owner":[],"postedDate":"October 7th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":55818765,"name":"Nuclear Medicine \u0026 Medical Imaging"},{"id":55818766,"name":"Artificial Intelligence and Machine Learning"}],"tags":[],"updatedAt":"2025-10-07T06:07:31+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-07 06:07:31","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7789831","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7789831","identity":"rs-7789831","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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.