Temporal acceleration of plant analysis algorithms

Temporal acceleration of plant analysis algorithms | 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 Temporal acceleration of plant analysis algorithms Gustavo Carnivali This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6931415/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 Population growth is notorious as temporal advancement, for this reason, plant analysis techniques have become common, this objective work studies this topic. The article proposes to offer computational temporal accelerations on plant analysis algorithms and techniques commonly used in planting analysis or other plant applications. Plant analysis techniques and algorithms commonly used in several other works, which will be accelerated in this work, are presented, as well as acceleration proposals, based on other works, with changes in the device used or changes to the input images used. and proposals. tests and graphical analyzes were carried out in order to test the computational processing gains of the proposed and presented methods, the acquired processing time was analyzed. The processing cost of the proposed methods was discussed, as well as the errors that theproposed accelerations can generate. Presenting the time gain that can be obtained. Plant analysis Optimization Timing Full Text Additional Declarations No competing interests reported. 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-6931415","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":500190051,"identity":"55f37ad3-98d7-4d86-b61f-c84539b26041","order_by":0,"name":"Gustavo Carnivali","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABEUlEQVRIiWNgGAWjYLCDAwwMFjz8IFZCAV6FjA1IWiR4JEHcBAMitQCBBIPBARCNR4t8RPrzBz/bbOT5Z589eJinRkLG+PzqxA8PDBjk+cUOYNVieCPHsLG3Lc1wxrm8hMM8xyR4zG683SwBdJjhzNkJ2LXMyGFs4DlzOIHhDI/BwRlsIC1nN4C0JBjcxqUl/WHjH6AWebCWfxI8xjPObv6BT4u8RIJhM0/F4QQDoJYDH9skeAz4e7fhtcWA543hbJmKNMONYC19EjwSN3i3WSQYSOD0i3x7+oOPbwxs5OXO8Bh/SPhmY8/ff3bzzR8VwDCUxmHLAQwhCbBKCazKwbY0YAjxY5oyCkbBKBgFIxsAAN+VYMlxIVfeAAAAAElFTkSuQmCC","orcid":"","institution":"Universidade Federal de Minas Gerais","correspondingAuthor":true,"prefix":"","firstName":"Gustavo","middleName":"","lastName":"Carnivali","suffix":""}],"badges":[],"createdAt":"2025-06-19 12:53:25","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6931415/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6931415/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":89246826,"identity":"3ddd8efb-631c-4f95-ad5e-8a65eed4e8c7","added_by":"auto","created_at":"2025-08-18 02:04:06","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":787205,"visible":true,"origin":"","legend":"","description":"","filename":"basee.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6931415/v1_covered_73973abf-a5b9-4b1f-ae29-fa9b2c64e1c4.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Temporal acceleration of plant analysis algorithms","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":"Plant analysis, Optimization, Timing","lastPublishedDoi":"10.21203/rs.3.rs-6931415/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6931415/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Population growth is notorious as temporal advancement, for this reason, plant analysis techniques have become common, this objective work studies this topic. The article proposes to offer computational temporal accelerations on plant analysis algorithms and techniques commonly used in planting analysis or other plant applications. Plant analysis techniques and algorithms commonly used in several other works, which will be accelerated in this work, are presented, as well as acceleration proposals, based on other works, with changes in the device used or changes to the input images used. and proposals. tests and graphical analyzes were carried out in order to test the computational processing gains of the proposed and presented methods, the acquired processing time was analyzed. The processing cost of the proposed methods was discussed, as well as the errors that theproposed accelerations can generate. Presenting the time gain that can be obtained.","manuscriptTitle":"Temporal acceleration of plant analysis algorithms","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-08-18 01:55:59","doi":"10.21203/rs.3.rs-6931415/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":"424aec93-b87a-4202-b44a-8e62a39f784d","owner":[],"postedDate":"August 18th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-08-18T01:55:59+00:00","versionOfRecord":[],"versionCreatedAt":"2025-08-18 01:55:59","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6931415","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6931415","identity":"rs-6931415","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}