Accelerated Border Tracking in Binary Images with GPUs

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This work presents an optimized algorithm for contour detection and extraction (i.e., border tracking) in binary images, aiming to improve performance in computer vision scenarios that require real-time processing. The proposed method is based on a parallel adaptation of the Suzuki algorithm, widely used in libraries such as OpenCV, but contributes a variant with the advantage of running efficiently on the GPU. The approach divides the image into rectangular blocks, processing each block in parallel to extract “triads” (structures representing three interconnected and ordered points). Subsequently, the triads are connected both within each block and between adjacent blocks to form complete, closed contours. The algorithm is composed of three stages, each implemented as CUDA kernels. The main goal of the proposed algorithm is to avoid costly data transfers between the CPU and GPU, which is especially beneficial when the algorithm is part of industrial workflows with high efficiency requirements.
Full text 11,935 characters · extracted from preprint-html · click to expand
Accelerated Border Tracking in Binary Images with GPUs | 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 Accelerated Border Tracking in Binary Images with GPUs Pedro Alonso-Jordá, Roberto Díaz-Cano, Enrique S. Quintana-Ortí, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7694436/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract This work presents an optimized algorithm for contour detection and extraction (i.e., border tracking) in binary images, aiming to improve performance in computer vision scenarios that require real-time processing. The proposed method is based on a parallel adaptation of the Suzuki algorithm, widely used in libraries such as OpenCV, but contributes a variant with the advantage of running efficiently on the GPU. The approach divides the image into rectangular blocks, processing each block in parallel to extract “triads” (structures representing three interconnected and ordered points). Subsequently, the triads are connected both within each block and between adjacent blocks to form complete, closed contours. The algorithm is composed of three stages, each implemented as CUDA kernels. The main goal of the proposed algorithm is to avoid costly data transfers between the CPU and GPU, which is especially beneficial when the algorithm is part of industrial workflows with high efficiency requirements. border tracking binary images GPU CUDA Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 16 Dec, 2025 Reviews received at journal 14 Nov, 2025 Reviews received at journal 09 Oct, 2025 Reviewers agreed at journal 08 Oct, 2025 Reviewers agreed at journal 30 Sep, 2025 Reviewers invited by journal 29 Sep, 2025 Editor assigned by journal 26 Sep, 2025 Submission checks completed at journal 25 Sep, 2025 First submitted to journal 23 Sep, 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-7694436","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":527254986,"identity":"43ab8482-8259-4790-8456-fe3a78ffe77f","order_by":0,"name":"Pedro Alonso-Jordá","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtUlEQVRIiWNgGAWjYFAC5gYQKUeKFkawFmPStSQ2EK3BnP1g4+OCPzbpG273GDB8+EOEFsuexGbjmW1puRvunDFgnNlGhBaDA4lt0rwNh3M33EhLYOYlxnkG5x+2SfP8OZxuANLyhxiHGdwA2sLDdjjB4EbyAWYGNiK0WM542GzM25ZmOPPO4QMHe4nxizl/8sHHPH9s5PluNzY++EGUw+AsCQaGA0RoQNMyCkbBKBgFowArAADzVDlsaR/pUwAAAABJRU5ErkJggg==","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":true,"prefix":"","firstName":"Pedro","middleName":"","lastName":"Alonso-Jordá","suffix":""},{"id":527254987,"identity":"4168fc5f-2eca-45d5-9a0a-833d6112ada4","order_by":1,"name":"Roberto Díaz-Cano","email":"","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":false,"prefix":"","firstName":"Roberto","middleName":"","lastName":"Díaz-Cano","suffix":""},{"id":527254988,"identity":"8cb6d1d4-e1e0-44ad-8163-9083bdccea94","order_by":2,"name":"Enrique S. Quintana-Ortí","email":"","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":false,"prefix":"","firstName":"Enrique","middleName":"S.","lastName":"Quintana-Ortí","suffix":""},{"id":527254989,"identity":"0301ca33-73ab-4dce-9d1d-556ac20029a9","order_by":3,"name":"Francesc Folch","email":"","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":false,"prefix":"","firstName":"Francesc","middleName":"","lastName":"Folch","suffix":""}],"badges":[],"createdAt":"2025-09-23 12:38:26","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7694436/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7694436/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":93190593,"identity":"dd454d8d-5748-48a7-b2f4-39d1fafceeb5","added_by":"auto","created_at":"2025-10-10 04:03:24","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":5017,"visible":true,"origin":"","legend":"","description":"","filename":"599ca28ff1124259b1ed8dc4c15a3237.json","url":"https://assets-eu.researchsquare.com/files/rs-7694436/v1/b199347a4fc452689509bd2c.json"},{"id":93191156,"identity":"60c33060-6349-46df-8c49-733b9b932d6c","added_by":"auto","created_at":"2025-10-10 04:11:23","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":339831,"visible":true,"origin":"","legend":"","description":"","filename":"2025SUPEAcceleratedBorderTracking.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7694436/v1_covered_734b21e0-6730-47fc-a231-cd924ac96c79.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Accelerated Border Tracking in Binary Images with GPUs","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":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"border tracking, binary images, GPU, CUDA","lastPublishedDoi":"10.21203/rs.3.rs-7694436/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7694436/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This work presents an optimized algorithm for contour detection and extraction (i.e., border tracking) in binary images, aiming to improve performance in computer vision scenarios that require real-time processing. The proposed method is based on a parallel adaptation of the Suzuki algorithm, widely used in libraries such as OpenCV, but contributes a variant with the advantage of running efficiently on the GPU. The approach divides the image into rectangular blocks, processing each block in parallel to extract “triads” (structures representing three interconnected and ordered points). Subsequently, the triads are connected both within each block and between adjacent blocks to form complete, closed contours. The algorithm is composed of three stages, each implemented as CUDA kernels. The main goal of the proposed algorithm is to avoid costly data transfers between the CPU and GPU, which is especially beneficial when the algorithm is part of industrial workflows with high efficiency requirements.","manuscriptTitle":"Accelerated Border Tracking in Binary Images with GPUs","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-10 04:03:18","doi":"10.21203/rs.3.rs-7694436/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-12-16T15:47:09+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-11-14T15:20:40+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-09T17:09:20+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"158098750922096289372634728851522724514","date":"2025-10-08T06:53:07+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"58801013385951453460911590475251946223","date":"2025-09-30T06:38:11+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-09-29T14:29:10+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-09-26T18:24:48+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-09-25T04:10:27+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2025-09-23T12:29:18+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"62046708-4807-4402-912a-8e0c7952a683","owner":[],"postedDate":"October 10th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-03-24T17:09:34+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-10 04:03:18","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7694436","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7694436","identity":"rs-7694436","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