A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Fast algorithm for 3-D vascular tree modeling
2003
Computer Methods and Programs in Biomedicine
A comparison between the new algorithms and the previous one is illustrated through the hepatic arterial tree. ...
A significant decrease of the computation time is obtained by replacing the global optimization by the fast updating algorithm allowing more complex structure to be simulated. ...
They range from the early 2-D models [2] to more recent surface-based ones [1] or to fully 3-D models [3, 4] with different objectives such as realistic representations for rendering applications ...
doi:10.1016/s0169-2607(01)00200-0
pmid:12507789
fatcat:5qr3didcl5aptijgghske75hvm
A fast automatic method for 3D volume segmentation of the human cerebrovascular
[chapter]
2002
CARS 2002 Computer Assisted Radiology and Surgery
A modified 3-D computer graphics based region-filling algorithm is used to sweep the vascular tree from seed locations in order to track and label the vascular structure. ...
The labeled-segmented images are extracted and a 3-D model is created using VTK toolkit. The 3-D model can then be viewed on a stereo graphics capable workstation or in a Virtual Reality environment. ...
The generous support of Norton Healthcare Organization for our medical research through Grants 97-72 and 97-73 is greatly appreciated.
References ...
doi:10.1007/978-3-642-56168-9_63
fatcat:oiapi2dxzjbr7lievbm4rrcfj4
Elastic Registration for Retinal Images Based on Reconstructed Vascular Trees
2006
IEEE Transactions on Biomedical Engineering
For the purpose of performance comparison, a weak affine model based fast chamfer matching technique is proposed and implemented. ...
Index Terms-Elastic matching, fast chafer matching, retinal image registration, vascular tree. ...
Weak Affine Model Based Fast Chamfer Matching To compare performance of the elastic matching algorithm, we adopt the weak affine model of translations and rotation for globally matching two vascular trees ...
doi:10.1109/tbme.2005.863927
pmid:16761845
fatcat:vs6xk634rjcydbjhis4a7kad5q
Explicit vascular reconstruction based on adjacent vector projection
2016
Bioengineered
In the end, the reconstructed vascular tree is rendered for volumetric visualization and localization of vascular malformations. ...
Based on adjacent vector projection, a simple and robust explicit algorithm is presented for vascular reconstruction. ...
[4] [5] [6] [7] Algorithms for blood vascular reconstruction can be generally grouped into implicit and explicit methods. 1 The implicit algorithms are model-free in a direct manner, [8] [9] [10] ...
doi:10.1080/21655979.2016.1226667
pmid:27710433
pmcid:PMC5240814
fatcat:6kdurje5nnasnf7ptwa5hg6vra
Numerical simulation of liver perfusion: from CT scans to FE model
[article]
2014
arXiv
pre-print
When the real vascular trees can not be obtained from the CT data we generate artificial trees using the constructive optimization method. ...
We have an application for semi-automatic generation of a finite element mesh of the human liver from computed tomography scans and for reconstruction of the liver vascular structure. ...
The fast generator is mainly used for testing purposes or for quick preview of the FE model of body parts, for comparison of both approaches see Fig. 3 . ...
arXiv:1412.6412v1
fatcat:renrug5ssvcn3hlfxhjsaiaeqe
Repairing the cerebral vascular through blending Ball B-Spline curves with G2 continuity
2016
Neurocomputing
So the triangle mesh of the vessel model generated for the medical images may appear many gaps. ...
In the paper, we present a extension algorithm for Ball B-Spline curve with G 2 continuity to repair the cerebrovascular structure from time-of-flight (TOF) magnetic resonance angiography (MRA) data. ...
(7) is viewed as two parts: the G 2 -continuity condition for skeleton 8 and for radius 9 cðα 3 Þ ¼ cð0Þ c 0 ðα 3 Þ ¼ α 1 c 0 ð0Þ c ″ ð0Þ ¼ α 2 1 c ″ ð0Þ 8 > < > : ð8Þ rðα 3 Þ ¼ rð0Þ r 0 ðα 3 Þ ¼ α ...
doi:10.1016/j.neucom.2015.08.028
fatcat:mrrl7bep7zfctjasdsf5aorc5q
Liver Vessels Segmentation Using a Hybrid Geometrical Moments/Graph Cuts Method
2010
IEEE Transactions on Biomedical Engineering
This paper describes a fast and fully-automatic method for liver vessel segmentation on CT scan pre-operative images. ...
The basis of this method is the introduction of a 3-D geometrical moment-based detector of cylindrical shapes within the min-cut/max-flow energy minimization framework. ...
Using this function we create a local 3-D costs map for each cylinder. ...
doi:10.1109/tbme.2009.2032161
pmid:19783500
pmcid:PMC2831400
fatcat:2wfbn4xdrvfedbkzx6g7h2o4iq
Design of Robust Vascular Tree Matching: Validation on Liver
[chapter]
2005
Lecture Notes in Computer Science
In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. ...
Vascular systems are segmented from CT-scan images acquired at different times, and then modeled as trees. ...
This work has benefited from the segmentation program of the vascular system developed by the IRCAD R&D team. ...
doi:10.1007/11505730_37
fatcat:mj3kebqrxfbgzfx3uhteavpili
Cerebrovascular Segmentation by Accurate Probabilistic Modeling of TOF-MRA Images
[chapter]
2005
Lecture Notes in Computer Science
We present a fast algorithm for automatic extraction of a 3D cerebrovascular system from time-of-flight (TOF) magnetic resonance angiography (MRA) data. ...
To validate the accuracy of our algorithm, a special 3D geometrical phantom motivated by statistical analysis of the MRA-TOF data is designed. ...
The accurate initial LCDG-model ensures fast convergence of the model refinement with the modified EM algorithm. ...
doi:10.1007/11499145_114
fatcat:j6pngkg2eralbdvare3lpaa3uy
Fast Unsupervised Segmentation of 3D Magnetic Resonance Angiography
2006
2006 International Conference on Image Processing
The model accounts for both laminar (for normal subjects) and turbulent blood flow (in abnormal cases like anemia or stenosis) and results in a fast algorithm for extracting a 3D cerebrovascular system ...
A new physically justified adaptive probabilistic model of blood vessels on magnetic resonance angiography (MRA) images is proposed. ...
Fig. 5 . 5 Slice in Fig. 2,B: our final (a,b) and the Wilson-Noble's (c,d) 3-class model (a,c) with the individual class submodels (b,d). ...
doi:10.1109/icip.2006.312370
dblp:conf/icip/El-BazFGEE06
fatcat:djvofy5qk5b2bfxkqfwz7p4k2m
Liver Registration for the Follow-Up of Hepatic Tumors
[chapter]
2005
Lecture Notes in Computer Science
These vascular systems are segmented from CT-scan images acquired (every six months) during disease treatement, and then modeled as trees. Our method matches common bifurcations and vessels. ...
Firstly, an original and efficient tree matching is applied on different segmentations of the vascular system of a single patient [1]. ...
This work has benefited from the segmentation program of the vascular system developed by the IRCAD R&D team. ...
doi:10.1007/11566489_20
fatcat:edyxw2f6offq5g2zdpco4tt6na
Algorithmically generated rodent hepatic vascular trees in arbitrary detail
2015
Journal of Theoretical Biology
Having successfully adapted the CCO algorithm to the rodent model organism, the resulting individual-specific refined hepatic vascular trees can now be used for advanced modeling involving, e.g., detailed ...
Finally, we applied the calibrated algorithm to refine measured vascular trees to the (higher) level of detail desired for specific applications. ...
Schwier and Dipen Parekh for coordinating and performing the vascular segmentation. ...
doi:10.1016/j.jtbi.2014.10.026
pmid:25451523
fatcat:txspho6jkrh2ritjkfxdtmwkp4
A Multiscale Framework for Defining Homeostasis in Distal Vascular Trees: Applications to the Pulmonary Circulation
[article]
2020
arXiv
pre-print
To define the vascular homeostasis and total hemodynamics in the vascular tree, we consider two time-scales: a cardiac cycle and a longer period of vascular adaptations. ...
Illustrative examples for symmetric and asymmetric fractal trees are presented to provide homeostatic values in normal subjects. ...
Fast-time Hemodynamics Here we present an algorithm that for a given geometry of a bifurcating tree and discrete frequency n , computes the impedance and then fast-time hemodynamics at each vessel. ...
arXiv:2001.04880v1
fatcat:b3tnpul3trhp5kejy3jnkyt4ny
Segmentation of 3D tubular objects with adaptive front propagation and minimal tree extraction for 3D medical imaging
2007
Computer Methods in Biomechanics and Biomedical Engineering
Received B; revised B; in final form B) Q2 We present a new fast approach for segmentation of thin branching structures, like vascular trees, based on Fast-Marching (FM) and Level Set (LS) methods. ...
We finally derive an efficient algorithm for extracting an underlying 1D skeleton of the branching objects, with minimal path techniques. ...
Moreover, once paths and shapes are extracted this fly-through is real-time due to the fast rendering of the triangulation of our implicit model.
4.4.4 Minimal vascular tree and computational fluid dynamics ...
doi:10.1080/10255840701328239
pmid:17671862
fatcat:g4pn5lvuj5bf5mahdexqz523cq
Probabilistic Modeling of Blood Vessels for Segmenting MRA Images
2006
18th International Conference on Pattern Recognition (ICPR'06)
The model accounts for both laminar (for normal subjects) and turbulent blood flow (in abnormal cases like anemia or stenosis) and results in a fast algorithm for extracting a 3D cerebrovascular system ...
A new physically justified adaptive probabilistic model of blood vessels on magnetic resonance angiography (MRA) images is proposed. ...
Figure 5 .Figure 6 . 56 Slice in Fig. 2,B: our final (a,b) and the Wilson-Noble's (c,d) 3-class model (a,c) with the individual class submodels (b,d). ...
doi:10.1109/icpr.2006.946
dblp:conf/icpr/El-BazFGEE06
fatcat:iawkyadt5jganatqz3nxlvl27m
« Previous
Showing results 1 — 15 out of 9,940 results