Dijkstra's algorithm applied to 3D skeletonization of the brain vascular tree: evaluation and application to symbolic

Customizable tubular model for n-furcating blood vessels and its application to 3D reconstruction of the cerebrovascular system

Understanding the 3D cerebral vascular network is one of the pressing issues impacting the diagnostics of various systemic disorders and is helpful in clinical therapeutic strategies. Unfortunately, the existing software in the radiological workstation does not meet the expectations of radiologists who require a computerized system for detailed, quantitative analysis of the human cerebrovascular system in 3D and a standardized geometric description of its components. In this study, we show a method that uses 3D image data from magnetic resonance imaging with contrast to create a geometrical reconstruction of the vessels and a parametric description of the reconstructed segments of the vessels. First, the method isolates the vascular system using controlled morphological growing and performs skeleton extraction and optimization. Then, around the optimized skeleton branches, it creates tubular objects optimized for quality and accuracy of matching with the originally isolated vascular data. Finally, it optimizes the joints on n-furcating vessel segments. As a result, the algorithm gives a complete description of shape, position in space, position relative to other segments, and other anatomical structures of each cerebrovascular system segment. Our method is highly customizable and in principle allows reconstructing vascular structures from any 2D or 3D data. The algorithm solves shortcomings of currently available methods including failures to reconstruct the vessel mesh in the proximity of junctions and is free of mesh collisions in high curvature vessels. It also introduces a number of optimizations in the vessel skeletonization leading to a more smooth and more accurate model of the vessel network. We have tested the method on 20 datasets from the public magnetic resonance angiography image database and show that the method allows for repeatable and robust segmentation of the vessel network and allows to compute vascular lateralization indices.

Recursive Rewarding Modified Adaptive Cell Decomposition (RR-MACD): A Dynamic Path Planning Algorithm for UAVs

A relevant task in unmanned aerial vehicles (UAV) flight is path planning in 3 D environments. This task must be completed using the least possible computing time. The aim of this article is to combine methodologies to optimise the task in time and offer a complete 3 D trajectory. The flight environment will be considered as a 3 D adaptive discrete mesh, where grids are created with minimal refinement in the search for collision-free spaces. The proposed path planning algorithm for UAV saves computational time and memory resources compared with classical techniques. With the construction of the discrete meshing, a cost response methodology is applied as a discrete deterministic finite automaton (DDFA). A set of optimal partial responses, calculated recursively, indicates the collision-free spaces in the final path for the UAV flight.