Projection-Based Collision Detection Algorithm for Stereoelectroencephalography Electrode Risk Assessment and Re-Planning

نویسندگان

چکیده

Surgical planning is crucial to Stereoelectroencephalography (SEEG), a minimally invasive procedure that requires clinicians operate with no direct view of the brain. Decisions making involves different clinical specialties and analysis multiple multimodal datasets. We present DepthMap tool designed localize, measure, visualize surgical risk, an AlternativeFinder tool, search for alternative trajectories maintaining adherence initial trajectory three re-planning strategies: similar entry, target, or parallel trajectory. The two tools transform 3D problem into 2D domain using projective geometry distance mapping. Both use graphics processing unit (GPU) create depth image used by measurement visualization, find trajectories. Tools were tested 12 SEEG cases digital subtraction angiography. was measure vessel distance. then alternatives. Computation time displacements entry target points each strategy recorded. found vessels in 118 (out 145). Ninety meet required avascular constraints (average 820K alternatives evaluated per trajectory). average computation 449 ms (77 when found). presented helped examine re-plan avoid vascular risks strategies. Quantitative shows potential this use.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPU-Based Parallel Collision Detection for Real-Time Motion Planning

We present parallel algorithms to accelerate collision queries for samplebased motion planning. Our approach is designed for current many-core GPUs and exploits the data-parallelism and multi-threaded capabilities. In order to take advantage of high number of cores, we present a clustering scheme and collision-packet traversal to perform efficient collision queries on multiple configurations si...

متن کامل

GPU-based parallel collision detection for fast motion planning

We present parallel algorithms to accelerate collision queries for sample-based motion planning. Our approach is designed for current many-core GPUs and exploits data-parallelism and multithreaded capabilities. In order to take advantage of high numbers of cores, we present a clustering scheme and collision-packet traversal to perform efficient collision queries on multiple configurations simul...

متن کامل

Collision Detection Algorithm Based on Data Parallelism

Abstract—Modern computing technology enters the era of parallel computing with the trend of sustainable and scalable parallelism. Single Instruction Multiple Data (SIMD) is an important way to go along with the trend. It is able to gather more and more computing ability by increasing the number of processor cores without the need of modifying the program. Meanwhile, in the field of scientific c...

متن کامل

RECODE: An Image-based Collision Detection Algorithm

Object interactions are ubiquitous in interactive computer graphics, 3D object motion simulations, virtual reality and robotics applications. Most collision detection algorithms are based on geometrical object–space interference tests. Some algorithms have employed an image– space approach to the collision detection problem. In this article, we demonstrate an image–space collision detection pro...

متن کامل

Depth Space Collision Detection for Motion Planning

Depth maps are an efficient representation of 3D free space. Encoding distance-to-camera in each pixel permits a dense, regular 2D representation of the space between a camera and the scenery it observes, which may be inspected to fulfill a useful class of object collision queries. In the proposed method, candidate poses of arbitrary 3D geometry are rendered into a depth map with depth testing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3099964