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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Nguyen-Le, Quoc-Bao, Le, Tuan-Hy, Do, Anh-Triet
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911628337872896
author Nguyen-Le, Quoc-Bao
Le, Tuan-Hy
Do, Anh-Triet
author_facet Nguyen-Le, Quoc-Bao
Le, Tuan-Hy
Do, Anh-Triet
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2412_10441
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data
Nguyen-Le, Quoc-Bao
Le, Tuan-Hy
Do, Anh-Triet
Graphics
Artificial Intelligence
Computer Vision and Pattern Recognition
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.
title Novel 3D Binary Indexed Tree for Volume Computation of 3D Reconstructed Models from Volumetric Data
topic Graphics
Artificial Intelligence
Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2412.10441