Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data

In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and binary indexed tree data structure, we developed an algorithm for...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Nguyen-Le, Quoc-Bao, Le, Tuan-Hy, Do, Anh-Triet
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Nguyen-Le, Quoc-Bao
Le, Tuan-Hy
Do, Anh-Triet
description In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and binary indexed tree data structure, we developed an algorithm for efficient computation of intrinsic volume of any volumetric data recovered from computed tomography (CT) or magnetic resonance (MR). We proposed the 30 configurations of volume values based on the polygonal mesh generation method. Our algorithm processes the data in scan-line order simultaneously with reconstruction algorithm to create a Fenwick tree, ensuring query time much faster and assisting users' edition of slicing or transforming model. We tested the algorithm's accuracy on simple 3D objects (e.g., sphere, cylinder) to complicated structures (e.g., lungs, cardiac chambers). The result deviated within $\pm 0.004 \text{cm}^3$ and there is still room for further improvement.
doi_str_mv 10.48550/arxiv.2412.10441
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_10441</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_10441</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_104413</originalsourceid><addsrcrecordid>eNqFjrEOgjAURbs4GPUDnHw_IFIoibOg0UEHQ1xJU16TJtBHSiH49wJhd7rLObmHsT0PA3FOkvAk3WD6IBI8CngoBF8z9aIeK4gzuBgr3RcetsQBS8gdImhy8KGqqxFSqpvOS2_IAulJeKMi23rXKT_yTyqxakE7qhfFO6Mgk15u2UrLqsXdsht2uF3z9H6cc4rGmXp8LqasYs6K_xM_lRlCgA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data</title><source>arXiv.org</source><creator>Nguyen-Le, Quoc-Bao ; Le, Tuan-Hy ; Do, Anh-Triet</creator><creatorcontrib>Nguyen-Le, Quoc-Bao ; Le, Tuan-Hy ; Do, Anh-Triet</creatorcontrib><description>In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and binary indexed tree data structure, we developed an algorithm for efficient computation of intrinsic volume of any volumetric data recovered from computed tomography (CT) or magnetic resonance (MR). We proposed the 30 configurations of volume values based on the polygonal mesh generation method. Our algorithm processes the data in scan-line order simultaneously with reconstruction algorithm to create a Fenwick tree, ensuring query time much faster and assisting users' edition of slicing or transforming model. We tested the algorithm's accuracy on simple 3D objects (e.g., sphere, cylinder) to complicated structures (e.g., lungs, cardiac chambers). The result deviated within $\pm 0.004 \text{cm}^3$ and there is still room for further improvement.</description><identifier>DOI: 10.48550/arxiv.2412.10441</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Graphics</subject><creationdate>2024-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.10441$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.10441$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Nguyen-Le, Quoc-Bao</creatorcontrib><creatorcontrib>Le, Tuan-Hy</creatorcontrib><creatorcontrib>Do, Anh-Triet</creatorcontrib><title>Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data</title><description>In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and binary indexed tree data structure, we developed an algorithm for efficient computation of intrinsic volume of any volumetric data recovered from computed tomography (CT) or magnetic resonance (MR). We proposed the 30 configurations of volume values based on the polygonal mesh generation method. Our algorithm processes the data in scan-line order simultaneously with reconstruction algorithm to create a Fenwick tree, ensuring query time much faster and assisting users' edition of slicing or transforming model. We tested the algorithm's accuracy on simple 3D objects (e.g., sphere, cylinder) to complicated structures (e.g., lungs, cardiac chambers). The result deviated within $\pm 0.004 \text{cm}^3$ and there is still room for further improvement.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Graphics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNqFjrEOgjAURbs4GPUDnHw_IFIoibOg0UEHQ1xJU16TJtBHSiH49wJhd7rLObmHsT0PA3FOkvAk3WD6IBI8CngoBF8z9aIeK4gzuBgr3RcetsQBS8gdImhy8KGqqxFSqpvOS2_IAulJeKMi23rXKT_yTyqxakE7qhfFO6Mgk15u2UrLqsXdsht2uF3z9H6cc4rGmXp8LqasYs6K_xM_lRlCgA</recordid><startdate>20241211</startdate><enddate>20241211</enddate><creator>Nguyen-Le, Quoc-Bao</creator><creator>Le, Tuan-Hy</creator><creator>Do, Anh-Triet</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241211</creationdate><title>Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data</title><author>Nguyen-Le, Quoc-Bao ; Le, Tuan-Hy ; Do, Anh-Triet</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_104413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Graphics</topic><toplevel>online_resources</toplevel><creatorcontrib>Nguyen-Le, Quoc-Bao</creatorcontrib><creatorcontrib>Le, Tuan-Hy</creatorcontrib><creatorcontrib>Do, Anh-Triet</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nguyen-Le, Quoc-Bao</au><au>Le, Tuan-Hy</au><au>Do, Anh-Triet</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data</atitle><date>2024-12-11</date><risdate>2024</risdate><abstract>In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and binary indexed tree data structure, we developed an algorithm for efficient computation of intrinsic volume of any volumetric data recovered from computed tomography (CT) or magnetic resonance (MR). We proposed the 30 configurations of volume values based on the polygonal mesh generation method. Our algorithm processes the data in scan-line order simultaneously with reconstruction algorithm to create a Fenwick tree, ensuring query time much faster and assisting users' edition of slicing or transforming model. We tested the algorithm's accuracy on simple 3D objects (e.g., sphere, cylinder) to complicated structures (e.g., lungs, cardiac chambers). The result deviated within $\pm 0.004 \text{cm}^3$ and there is still room for further improvement.</abstract><doi>10.48550/arxiv.2412.10441</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2412.10441
ispartof
issn
language eng
recordid cdi_arxiv_primary_2412_10441
source arXiv.org
subjects Computer Science - Artificial Intelligence
Computer Science - Computer Vision and Pattern Recognition
Computer Science - Graphics
title Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T06%3A39%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Novel%203D%20Binary%20Indexed%20Tree%20for%20Volume%20Computation%20of%203D%20Reconstructed%20Models%20from%20Volumetric%20Data&rft.au=Nguyen-Le,%20Quoc-Bao&rft.date=2024-12-11&rft_id=info:doi/10.48550/arxiv.2412.10441&rft_dat=%3Carxiv_GOX%3E2412_10441%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true