Interactive Visualization of Volumetric White Matter Connectivity in DT-MRI Using a Parallel-Hardware Hamilton-Jacobi Solver
|
|
- Eileen McDowell
- 5 years ago
- Views:
Transcription
1 Appears in: Proc. IEEE Visualization, 00, pp. 0 Interactive Visualization of Volumetric White Matter Connectivity in DT-MRI Using a Parallel-Hardware Hamilton-Jacobi Solver Won-Ki Jeong, Student Member, IEEE, P. Thomas Fletcher, Ran Tao, and Ross T. Whitaker Member, IEEE Abstract In this paper we present a method to compute and visualize volumetric white matter connectivity in diffusion tensor magnetic resonance imaging (DT-MRI) using a Hamilton-Jacobi (H-J) solver on the GPU (Graphics Processing Unit). Paths through the volume are assigned costs that are lower if they are consistent with the preferred diffusion directions. The proposed method finds a set of voxels in the DTI volume that contain paths between two regions whose costs are within a threshold of the optimal path. The result is a volumetric optimal path analysis, which is driven by clinical and scientific questions relating to the connectivity between various known anatomical regions of the brain. To solve the minimal path problem quickly, we introduce a novel numerical algorithm for solving H-J equations, which we call the Fast Iterative Method (FIM). This algorithm is well-adapted to parallel architectures, and we present a GPU-based implementation, which runs roughly 0-00 times faster than traditional CPU-based solvers for anisotropic H-J equations. The proposed system allows users to freely change the endpoints of interesting pathways and to visualize the optimal volumetric path between them at an interactive rate. We demonstrate the proposed method on some synthetic and real DT-MRI datasets and compare the performance with existing methods. Index Terms Diffusion tensor visualization, graphics hardware, interactivity. INTRODUCTION Diffusion tensor magnetic resonance imaging (DT-MRI) is a powerful technique for imaging in vivo properties of white matter tissue in the human brain. Visualizations of the white matter pathways and of possible abnormalities along these pathways are an important tool for clinicians studying neuropsychiatric disorders. The physical principle behind diffusion imaging is that the motion of water is impeded in directions that are not parallel to the axons. In DT-MRI a diffusion tensor at each voxel gives an estimated model of the pattern of water diffusion aggregated over a point-spread function of the measurements. The neural fiber orientation is typically inferred from the principal eigenvector of the diffusion tensor, which is the direction of highest probability of water motion. Several methods based on the Hamilton-Jacobi (H-J) equation have recently been introduced as a means for describing connectivity in white matter. A considerable amount of research has focused on developing numerically efficient algorithms to solve the H-J equation. Most solvers are based on either iterative schemes using pre-defined update orders or one-pass schemes using sorted data structures. However, solving the H-J equation on highly anisotropic speed volumes, such as those found in DT-MRI, usually requires at least a few minutes even on the fastest processor, making the application less interactive. Therefore, there remains a need for fast solutions to the H-J equation in a variety of visualization-related applications.. GPUs have evolved into a massively parallelized multiprocessor machine over the last few years. The current GPUs have up to microprocessors running in a SIMD fashion, producing throughput of several hundreds GFLOPS (Giga Floating Point Operations Per Second). The GPU supports high precision computation up to bit floating point (bit is on its way), has extremely wide memory bandwidth, and is fully programmable. In addition, the new generation GPUs based on DirectX 0 support much more flexible flow controls and memory management, and provide rich instruction sets and high level languages for GPGPU (General Purpose computation on the Won-Ki Jeong, P. Thomas Fletcher, Ran Tao, and Ross T. Whitaker are with the Scientific Computing and Imaging Institute, School of Computing, University of Utah, S. Central Camput Dr., Salt Lake City, UT. {wkjeong, rantao, whitaker}@cs.utah.edu, fletcher@sci.utah.edu. Manuscript received March 00; accepted August 00; posted online October 00. For information on obtaining reprints of this article, please send to: tvcg@computer.org. GPU) that help to reduce the overhead of executing graphics APIs and provide more flexible programming models. Due to their increasing computational power and programming flexibility, current GPUs are becoming a very powerful parallel computing platform for GPGPU problems []. In this paper we introduce an interactive system to compute and visualize volumetric white matter connectivity in DT-MRI volumes. Our method is based on the framework for volumetric quantification of DTI connectivity previously presented in []. While that work focused on quantification of connectivity and the computations were ne offline on the CPU, this paper extends the visualization aspect of the method and focuses on an efficient, interactive computational algorithm on the GPU. Existing CPU-based methods to extract DT-MRI white matter connectivity rely on the pre-computed distance volume because distance computation on the anisotropic speed volume is a highly timeconsuming process, and therefore, up to our knowledge, there are no existing systems that can extract the pathways in the DT-MRI volumes at an interactive rate. The proposed system uses the graphics processors to solve the H-J equation quickly, roughly 0-00 times faster than traditional CPU-based solvers, allowing users to freely change the endpoints of interesting pathways and to visualize the volumetric connectivity between them at an interactive rate. The main contribution of this paper is introducing a novel numerical algorithm to solve the H-J equation that can be well-adapted to various parallel architectures, an improved Godunov Hamiltonian computation, and a GPU implementation of the proposed H-J solver. RELATED WORK. DT-MRI connectivity Much of the work in DT-MRI connectivity focuses on fiber tractography [], in which streamlines are computed, by forward integration from a seed point, of the field of vectors defined by the principal eigenvector of the tensor at each point (interpolated between voxels), and where the twofold ambiguity of eigenvector directions is resolved by the continuity of paths. As a clinical tool for analyzing white matter pathways, tractography suffers from several drawbacks. First, imaging noise can cause fiber tracts to stray due to accumulating errors in the integration. The second issue is partial voluming. The finite size of a voxel measurement at fiber crossings (combined with sensor noise) can cause the direction of the major eigenvector to be ambiguous, further misleading the streamlines. This problem is aggravated by the fact that streamlines are often computed, displayed, and analyzed at subvoxel resolution suggesting a level of precision that is not warranted
2 Appears in: Proc. IEEE Visualization, 00, pp. 0 Fig.. System Overview. From left to right: a) Input DT-MRI volume; b) Seed points (marked as red circles); c) Cost volume (blue to red : low to high); d) Volumetric path along genu (blue). by the data. Finally, region-to-region analysis with conventional tractography is challenging, because there is no way to steer tracts from a seed point toward a particular target region. To address these problems, several researchers propose tractography algorithms that rely on a stochastic integration, in which flow vector are chosen from a distribution around the principal eigenvector. These stochastic techniques can be combined with Monte-Carlo simulations, which may include tens of thousands of paths from a single seed, of which only a small fraction will typically reach the target [,,, ]. Several H-J methods for white matter connectivity have been proposed to overcome some of the difficulties arising in tractography. These methods compute the cost of the shortest path from a seed region to every pixel in the volume (usually a white matter mask). This cost function consists of an integral that depends on path position and orientation, and typically penalizes paths that not agree with the tensors. These H-J formulations result in first-order partial differential equations (PDEs) which model evolving fronts whose speeds are determined by information from the diffusion tensor. These methods are inherently more robust to noise in the diffusion weighted measurements than standard tractography. Parker et al. [] evolve a front with speed related to the inner product of the front normal with the principal eigenvector of the tensor. O Donnell et al. [] propose using the diffusion tensor as a Riemannian metric in the image main and compute a front representing arrival time of geodesics beginning at a single seed point. Connectivity to that point is defined as a ratio of Euclidean path length to Riemannian distance. Jackowski et al. [] use a speed derived as a function of the diffusivity magnitude in the front normal direction. They solve this Hamiltonian equation using a Lax-Friedrichs scheme, also beginning with an initial seed point. Pichon et al. [] define a directionally dependent local cost function that extends the H-J framework to high-angular diffusion data. In all of these works, the end result is either a dense field of connectivities to regions or a set of optimal paths emanating from a seed region, which are determined by integrating the characteristics of the PDEs.. Hamilton-Jacobi equation solver A number of different numerical strategies have been proposed to efficiently solve the H-J equation. These methods can be classified into two groups. One is a class of iterative methods based on a fixed-point update using Jacobi or Gauss-Seidel schemes. An early work by Rouy et al. [] solves the Eikonal equation, a special case of H-J equation, by updating the solutions of the grid using a pre-defined updating order and Godunov upwind Hamiltonian until they converge. Zhao [] proposed the Fast Sweeping method, which uses a Gauss-Seidel updating order for fast convergence. Tsai et al. [] employed the Fast Sweeping method and a Godunov upwind discretization of the class of convex Hamiltonians to solve anisotropic H-J equations. The proposed Godunov Hamiltonian uses only -neighborhood pixels, so it maps well on iterative schemes. However, there are many cases to check for the correct solution of the Hamiltonian. Kao et al. [0] introduced a new interpretation of Hamiltonians based on the Legendre transformation, and in a subsequent paper [] they employed the Lax-Friedrichs Hamiltonian for arbitrary static H-J equations. The proposed method is simple to implement and can be used widely on both convex and non-convex H-J equations, but it requires many more iterations than the Godunov Hamiltonian and the solution shows excessive diffusion due to the nature of the scheme. Another class of H-J solvers is based on adaptive updating schemes and sorting data structures. An earlier work by Qin et al. [] and later Sethian et al. [,, ] used a Dijkstra-type shortest path algorithm to solve H-J equations, which is generally referred to as the Fast Marching method. The main idea behind this method is that solutions for a convex Hamiltonian depend only on the upwind neighbors along the characteristics, so the causality relationship can be determined uniquely and the correct solutions can be computed by only a single pass update. The complexity of the Fast Marching method is O(NlogN), which is worst-case optimal, and the running time is not much affected by the complexity of the speed. However, for a class of general H-J equations [], tracing the characteristics can cause expensive searching among a wider range of neighborhoods than solving equations using an iterative numerical method. In addition, the method uses a global sorting data structure, e.g., a heap, and therefore the parallelization is not straightforward. Even though there has been much research effort on general purpose computing using the GPU, so far no one has developed a parallel algorithm for solving general H-J equations on the GPU. The closest work has focused on the distance or Voronoi diagrams computations on the GPU, which is equivalent to solving the Eikonal equation with a constant speed, a special case of the H-J equation. Hoff et al. [] first used OpenGL API and hardware rasterization in the fixed graphics pipeline to compute approximated Voronoi diagrams. Sigg et al. [] employed a scan conversion algorithm and used fragment programs to compute the distance to triangular meshes within narrow bands around the mesh. Sud et al. [] proposed a method to reduce unnecessary distance computations by using culling and clamping algorithms. The distance transform approaches shown above are all based on the assumption of isotropic constant speed over the main, so they are not applicable to solving the H-J equation based on anisotropic tensor speed functions. REGION-TO-REGION CONNECTIVITY Our formulation of region-to-region connectivity is based on the principle of minimal cost paths. Using information from the entire diffusion tensor, we construct a local cost function based on the current position and directionality of a path. This leads to a first-order nonlinear PDE that computes the minimal cost from a starting region to each point in the image. Unlike previous front-propagation methods for DT-MRI, we then solve for minimal cost from a second target region. The two solutions are then combined, giving the minimal cost through each voxel of paths restricted to travel between the two target regions. The minimal cost function can then be used to threshold the data for visualization of only the pertinent white matter pathways. Also, the cost function serves as a measure of the strength, or integrity, of the connection. Visualizations of this cost function can be used to
3 Appears in: Proc. IEEE Visualization, 00, pp. 0 locate abnormalities, or weaknesses, in the white matter pathways in individuals with neuropsychiatric disorders. An overview of our interactive region-to-region connectivity visualization system is shown in Figure. First, a volume rendering of the fractional anisotropy (FA), which is a measure of the anisotropy or elongation of the tensors, is displayed. Next, two starting seed points are chosen on D orthogonal slices of the FA map as the endpoints of the desired white matter pathway. Next, the cost function is computed using the GPU H-J solver as described in this paper. The cost function is volume rendered, displaying the areas of high connectivity between the two regions. Finally, the current pathway can be rendered by thresholding the cost function. Given a path c : [a,b] Ω, where Ω is a compact image main, we define the total cost of c as b E(c) = ψ(c(t),t(t))dt, () a where T(t) = c (t)/ c (t) is the unit tangent vector of c. The total cost is defined as the integral of a local cost function, ψ : Ω S R, where ψ(x,v) gives the cost of moving in the unit direction v S from the point x Ω. We require that the local cost be symmetric, ψ(x,v) = ψ(x, v), which is generally consistent with the model of diffusion through passive media. This metric in () allows for a wide range of cost functions ψ that incorporate tangents. Pichon et al. [] describe the properties of this metric, the choices of ψ for high-angular diffusion data, and the relationship between this cost function and the corresponding speed that controls the motion of the wavefront in the H-J formulation. In this work we use a quadratic (bilinear) local cost function, with the understanding that all of the results in this paper generalize to highangular data using the methods described in []. Thus we have ψ(x,v) = v T M(x)v, () where M(x) is a symmetric, positive-definite matrix defined at each point x Ω. The relationship between the measured diffusion tensor field, D, and the metric for the path cost, M, must be considered carefully. We find that using the inverse of the original tensor field, M = D, as proposed in most H-J DTI approaches [,, ], es not sufficiently penalize paths in directions perpendicular to the major eigenvector. In fact, shortest paths using this method typically look almost identical to the paths defined by isotropic metrics constrained the white matter mask. Thus, we use a sharpened tensor field, which is the original tensor field raised to a power α. This must be combined with a normalization, and for this work we normalize by the tensor volume. If we consider the sharpened tensor to be speed (in the H-J formulation), which gives low cost along the principal eigen directions, the cost is the inverse, and we have ( ) α M(x) = D(x) D(x), () D(x) where α > is a constant and D(x) denotes the determinant of D(x). We used α = for all of the experiments in this paper. We can consider all paths emanating from a region R Ω. Let u (x) denote the minimal cost as defined by () over all paths beginning in the region R and terminating at the point x. Then u satisfies the convex H-J equation given as follows: H( u,x) = ( u ) T M( u ) =, x Ω, () where Ω is a main in R n, u (x) is the travel time or distance from the source, R, and M is the speed matrix defined on Ω by Equation. We use the Hamiltonian defined below for our D DT-MRI connectivity problem: H(p,q,r) = ap + dq + f r + (bpq+cpr+ eqr) () M = a b c b d e c e f, p = u i x,q = u i y,r = u i z where p,q, and r are partial derivatives of u i at x along x,y, and z axis, and a,b,c,d,e, and f are triangular elements of the matrix M. Equation becomes the Eikonal equation when M is an identity matrix. While u gives us a measure of the connectivity from the region R to any point in the image, we would like to assess the specific connectivity to a second target region. To this, we define a second region R Ω and corresponding minimal cost function u also satisfying (). Consider all paths beginning in the region R and terminating in R. Now we define the total cost function for regions R and R to be u(x) = u (x)+u (x). The value of u(x) is the minimal cost of all paths between R and R that are constrained to pass through x. Figure shows the cost functions for paths along genu ((a) u, (b) u, and (c) the total cost u = u + u ). (a) Cost u (b) Cost u (c) Total cost u Fig.. The cost functions for genu. Blue to red: low cost to high cost. We use the total cost function u to define which voxels in the image are contained in the pathway of interest. Let γ be the minimal total cost path, and fix a threshold ε 0, which is the tolerance of paths relative to the optimum. We define an ε-point as a point whose constrained minimum cost is less than (+ε)e(γ). The set of all such ε-points defines an volumetric pathway between R and R. This region is the set of voxels that belong to the fiber connection between R and R. By definition, a volumetric pathway must contain γ for any value of ε 0. PARALLEL HAMILTON-JACOBI EQUATION SOLVER. Fast Iterative Method FIM is a numerical algorithm to solve PDEs, such as Equation, on parallel architectures. The main idea of FIM is to solve the H-J equation selectively on the grid nodes without maintaining expensive data structures. FIM maintains a narrow band, called the active list, for storing the index of grid nodes to be updated. Instead of using a special data structure to keep track of exact causal relationships, it maintains a looser relationship and update all nodes in the active list simultaneously (i.e., Jacobi update). During each iteration, we expand the list of active nodes, and the band thickens or expands to include all nodes that could be influenced by the current updates. A node can be removed from the active list when the solution is converged, and re-inserted when any changes of its adjacent neighbors affect the solution of the current node. Note that newly inserted nodes must be updated in the following update iteration to ensure a correct Jacobi update. To compute the solutions of the nodes in the active list, we use the Godunov upwind discretization of the Hamiltonian (section.). The key ideas of the proposed algorithm are two fold: allowing multiple updates per node by reinserting nodes to the active list, and using a Jacobi update for parallel computation. It turns out that the proposed algorithm is an example of a class of label-correcting algorithms [0]. Algorithm. is the pseu code of FIM (U x is a discrete approximation of u(x), and g(u x ) is a new solution at x that satisfies Equation computed using a Godunov Hamiltonian H G in Equation ).
4 Appears in: Proc. IEEE Visualization, 00, pp. 0 Algorithm.: FIM(X) comment:. Initialization (X : set of all grid nodes, L : active list) for each x X if x is source then U x 0 else U x for each { x X if any neighbor of x is source then add x to L comment:. Update nodes in L while L is not empty for each x L T old U x T new g(u x ) if T old > T new then { U x T new if T old T new < ε for each -neighbor x nb of x if x nb is not in L T old U xnb T new g(u xnb ) then then if T old > { T new Uxnb T then new add x nb to L remove x from L. Godunov Hamiltonian To efficiently solve convex H-J equations, we employ a similar Godunov upwind Hamiltonian as introduced in []. The Godunov Hamiltonian H G for the H-J equation on D grid can be defined as follows: where H G (p,q,r) = ext p I[p,p + ]ext q I[q,q + ]ext r I[r,r + ]H(p,q,r) () ext x I[a,b] = min x [a,b] if a b ext x I[a,b] = max x [b,a] if a > b p ± = D x ± u, q ± = D y ± u, r ± = D z ± u, and I[a,b] is the closed interval bounded by a and b. This definition of the Godunov Hamiltonian looks complicated, but the main idea is evaluating the Hamiltonian H(p, q, r) with all possible combination of p = {p, p +, p σ },q = {q,q +,q σ }, and r = {r,r +,r σ } where p σ,q σ, and r σ are critical points (because the extremum of a convex Hamiltonian occurs only on either the end of the interval or the critical point), and taking the valid minimum solution that satisfies Equation. To check the validity of the solution for H(p,q,r), Tsai et al. proposed the following conditions []. H(sgnmax{(p p σ ) +,(p + p σ ) }+ p σ,q,r) = H(p,sgnmax{(q q σ ) +,(q + q σ ) }+q σ,r) = H(p,q,sgnmax{(r r σ ) +,(r + r σ ) }+r σ ) = Even though the above test to check the validity of the solution looks mathematically clean and works well, practically it is not efficient due to two reasons. First, this test requires three evaluations of the Hamiltonian, which is an expensive operation. Second, we need to use a threshold to numerically check the floating point equality ( H < ε), which may induce numerical errors. The new validity test we propose is based on the observation that if the solution is valid then p, q, or r used to compute the solution must be a correct value. For example, if we use p = p, then sgnmax{(p p σ ) +,(p + p σ ) }+ p σ = p must hold. Checking equality for this equation can be ne efficiently because we can encode the left and the right side of the equation using integers, +, 0, and -, and compare equality of the integers. The right side index is determined by p, and the left side index is determined by p, p +, and p σ based on the new solution. 0 if p = p σ Right side index = + if p = p + if p = p 0 if p < p σ < p + Left side index = + else if (p + p + )/ < p σ else The proposed test es not entail an extra burden of Hamiltonian computations, and can be ne using only simple integer equality and float inequality comparisons. Our experiments show that using the new validity test can increase the performance about 0% compared to the original method []. The pseu code for computing a new solution g(u x ) is given in [?]. GPU IMPLEMENTATION. GPU FIM for H-J Solver We have chosen the GPU to implement FIM to solve the H-J equation. The major difference between the CPU and the GPU implementation of FIM is that the GPU employs a block-based updating scheme, as proposed by Lefohn et al. [] in the context of interactive level set computations, because the GPU architecture favors coherent memory access and control flows. The original node-based FIM (Algorithm.) can be easily extended to a block-based FIM as shown in Algorithm.. For a block-based update, the main is decomposed into pre-defined size blocks (we use a cube for D in the GPU implementation), and solutions of the pixels in the same block are updated simultaneously with a Jacobi update scheme. Therefore, the active list of the GPU maintains the list of active blocks instead of nodes. Algorithm.: GPU FIM(L,V) comment: Update blocks b in active list L, V :list of all blocks while L is not empty comment: Step - Update Active Blocks for each b L for i = 0 to n { (b,c p (b)) g(b) C b (b) reduction(c p (b)) comment: Step - Check Neighbors for each b L and if C b (b) = true for each { -neighbor b nb of b then (bnb,c p (b nb )) g(b nb ) C b (b nb ) reduction(c p (b nb )) comment: Step - Update Active List clear(l) for each { b V if Cb (b) = false then { Insert b to L The GPU FIM algorithm consists of three steps. First, each active block is updated with a pre-defined number of iterations. During each iteration, a new solution of Equation is computed, replace the old solution if the new solution is smaller, and its convergence is encoded as a boolean value. After the update step, we perform a reduction
5 Appears in: Proc. IEEE Visualization, 00, pp. 0 (Section..) on each active block to check whether it is converged or not. If a block is converged, we mark it as to-be-removed. The second step is checking which neighbor blocks of to-be-removed blocks need to be re-activated. To this, all the adjacent neighbor blocks of tobe-removed blocks are updated once, and another reduction operation is applied on each of the neighbor blocks. The final step is updating the active list by checking the convergence of each block. Only nonconverged blocks (i.e., C b is false) will remain in the active list. The following is a GPU FIM pseu code for updating active blocks (C p and C b are introduced in Section.).. Implementation Detail Our GPU H-J solver is implemented on an NVIDIA GeForce 00 GTX graphics card. NVIDIA CUDA [] is used for GPU programming, and we will explain the GPU implementation details based on the CUDA programming model (please refer to the CUDA programming guide [] for more details about the GPGPU programming using CUDA). Computation on the GPU entails running a kernel with a batch process of a large group of fixed size thread blocks, which fits well the block-based update method used in the FIM algorithm. We fix the block size to, so threads share the same shared memory and are executed in parallel on the same processor unit. It is not necessary to use special data structures, e.g., list or vector, to implement the active list on the GPU. Therefore, we use a simple D integer array whose size is the total number of blocks to store active blocks. Only the array elements of index ranging between 0 to (number of total active blocks-) are valid at any given time. For each CUDA kernel call, the grid size is adjusted to the current number of active blocks, and when a block is being processed, its block index is retrieved from the active list on the GPU. Updating solutions and reductions, which are computationally minant in the overall process, are ne entirely on the GPU. In the GPU memory, we create two sets of boolean arrays, one C p with a size of the number of pixels (i.e., nodes), and the other C b with a size of the number of blocks, to store convergence of pixels and blocks, in addition to a float array with a size of the number of pixels to store solutions. To check the convergence of blocks, we run a reduction on C p to get C b. Managing the active list, e.g., inserting or deleting blocks from the list, is efficiently ne on the CPU by reading back C b to the CPU and looping over it to insert only non-converged blocks to the active list. When the list is completely updated on the CPU, it is copied to the GPU, but only a small part of the active list is actually used at any given time (index 0 to (number of active blocks-)), so only a small fraction of contiguous memory needs to be copied to the GPU... Data Packing for Coalesced Global Memory Access To efficiently move data from global to shared memory on the GPU, we need to pack the data in the GPU memory space in a certain way to access global memory as a single contiguous, aligned memory access (coalesced memory access []). Volumes are stored in memory as an D array with a certain traversing order. Figure shows an example of two different cases of storing a x image in the GPU global memory space as D array when a block is copied to shared memory. Host memory is the CPU side memory, and global / shared memory is the GPU side memory. Color represents the pixels in the same block. Usually pixels are stored from the fastest to the slowest axis order, as shown in Figure (a). In this case, a block is split into two regions in global memory space, which leads to split block accesses. However, if we re-order global memory as shown in Figure (b), accessing a block can be a single coalesced memory access, which is the most efficient way to access global memory on the GPU. Hence, whenever input volumes are copied from the CPU to the GPU memory, a proper re-ordering should be applied so that the block access can be ne through a coalesced memory access... Efficient Neighbor Access using Shared Memory Another factor that affects the GPU performance is accessing shared memory. The shared memory space in the NVIDIA G0 architec- Host Memory Global Memory... (a) Non-coalesced Shared Memory Host Memory Global Memory... (b) Coalesced Shared Memory Fig.. Example of coalesced/non-coalesced global memory access ture is divided into banks, and shared memory accesses can be ne simultaneously as long as all the memory requests refer to different memory banks or to the same memory bank. If any two memory requests, but not all, refer to the same memory bank, i.e., bank conflict, then this request must be serialized, and this impairs the performance. Because the block size is fixed to, there is no bank conflict to access pixels inside blocks (block size is a multiple of warp size []). However, we need adjacent neighbor pixels to solve the PDEs, so we should set up an additional shared memory space for left/right/up/wn/top/bottom neighbors of the boundary pixels of each block. To avoid bank conflicts, we assign the neighbor pixels to predefined banks, which requires a slightly larger extra shared memory space. Figure shows a D example of the bank assignment that avoids bank conflicts for neighbor pixel access. The block size for this example is (x), which is drawn as a yellow box on the leftmost image in Figure. The extra four pixels on each left/right/up/wn side of the block are neighbor pixels. The number on each pixel represents the bank number to be assigned. By assigning pixels to shared memory in this pattern, memory requests for left/right/up/wn neighbors can be ne simultaneously without a bank conflict (Figure red : left neighbors, cyan : right neighbors, green : up neighbors, blue : wn neighbors). We need shared memory of size *blocksize to store a block and its neighbors because some bank numbers appear twice (,,, and in Figure ). Figure shows an example of actual pixel assignment in shared memory. Figure (a) shows a D block diagram with pixel indices (not bank numbers). Figure (b) shows which bank each pixel is actually assigned to. Figure (c) shows a snapshot of a shared memory access pattern when left neighbors are accessed (same case as the second diagram from left in Figure ). Pixels colored in red are accessed by threads in parallel. Because there is no bank conflict, this memory request can be processed simultaneously. The D bank assignment technique can be easily extended to D by using slightly larger shared memory for storing top and bottom neighbors. Fig.. Neighbor pixel access without shared memory bank-conflict 0 0 (a) Pixel indices Bank Bank Bank Bank Bank Bank Bank Bank Bank Bank 0 Bank Bank Bank Bank Bank Bank Fig.. Bank assignment example (b) Bank assignment Bank Bank Bank Bank Bank Bank Bank Bank Bank Bank 0 Bank Bank Bank Bank Bank Bank (c) Left neighbors
6 Appears in: Proc. IEEE Visualization, 00, pp. 0 Fig.. Volumetric pathways extractions using the proposed method. From left to right: a) cortocospinal tract; b) isosurface rendering of volumetric paths shown with FA slice; c) isosurface rendering of volumetric paths only. GCC(cyan), BCC(yellow), SCC(red), LCG(green), and RCG(blue). The SCIRun software [?] is used to render final isosurfaces... Reduction Reduction is one of the commonly used computational techniques in the streaming programming model to produce a smaller stream from a larger input stream. To check the convergence of a block, we need to check the convergence of every pixel in the block. Therefore, we need to reduce a block wn to a single pixel that represents the convergence of the block. Lefohn et al. proposed a reduction on the GPU using a fragment shader to check the activity in blocks in []. We implemented a parallel reduction in a single kernel execution using a block-level thread synchronization provided by CUDA. To reduce a block of size n, start with n threads. For each iteration, every thread participating in reduction reads two convergence values from the current block and write a true or false to one of the original locations (both converge : true, else false). In the next iteration, the number of participating threads is halved and the same reduction is performed. This process is repeated until a block is reduced to a single pixel. RESULTS. Connectivity Visualization To demonstrate our interactive DTI connectivity visualization for real clinical data, we applied our method to a single high-resolution (.mm ) T image from a database of healthy controls. Using an interface in which points can be selected interactively on the tensor data set, we selected the terminal regions R and R at the white/grey matter interface for each tract we analyzed. Figure (a) shows the interactive path extraction using two selected points along the cortocospinal tract. A volume rendering of the total cost function u is displayed with blue representing lowest cost regions. The total cost function represents the strength, or integrity, of the connection, and this visualization could be used by clinicians to locate degradations in the white matter. The cortocospinal tract, which is a major pathway connecting the spinal cord to the motor cortex, has high connectivity and thus shows up as bright blue. Next, we selected five tracts for visualization: three bundles through the genu (GCC), splenium (SCC), and body (BCC) of the corpus callosum, and the left (LCG) and right (RCG) cingulum bundles. Figure (b) and (c) show isosurface renderings of the resulting volumetric pathways from the five selected tracts. These volumetric pathways can then be used to define a culling region for displaying the tensor data only in the pathways of interest, as shown in Figure. In [] the authors describe nonparametric methods for quantifying DTI and geometric information along tracts.. Running time comparison Table and Figure show the running time of three H-J equation solvers (GPU, CPU Fast Sweeping with Godunov Hamiltonian, and CPU Fast Sweeping with Lax-Friedrichs Hamiltonian) and their solutions on three synthetic and real tensor volumes. We have tested H-J solvers on a PC equipped with a Intel Core Duo.GHz processor and an NVIDIA GeForce 00 GTX graphics card. Example is a volume with a constant tensor elongated along the diagonal direction (a = d = f =.0 and b = c = e = 0.). The level sets of the solution on this volume is shown in Figure (a). The GPU solver took only sec while the CPU solvers take about minutes to compute the solution on this volume. Example is a volume with tensors aligned to a helix. We built a tensor whose minant eigenvector is parallel to the tangent vector of the helix curve, and set the minant eigenvalue as.0 and the other two eigenvalues as Figure (b) is the solution and characteristic paths tracing from ranmly distributed points to the seed point placed on the center of the bottom slice. The GPU solver took. second, while the CPU solvers took minutes on this volume. Example is a DT-MRI brain volume of size xx00, with the number of effective pixels is K (we only run the solver inside the white matter mask), and the solution is given in Figure (c). We put a seed at the center of the white matter region. The GPU solver runs less than seconds while the CPU solver took minutes on this volume. Overall, the proposed GPU H-J solver runs roughly 0 00 times faster than the commonly used CPU-based methods, allowing users for interactive volumetric paths extraction in DT-MRI volumes. Example Example Example GPU FIM sec. sec. sec CPU FS Gdv sec sec 0 sec CPU FS L-F sec 0 sec N/A Table. Running time on D tensor volumes. L-F was not tested on example due to its complex boundary.. Discussion The proposed GPU-FIM algorithm, in contrast to other labelcorrecting algorithms [0], scales well on massively parallel architectures by apting a block-based parallel updating scheme. The proposed method uses the same discretization of Godunov Hamiltonian that is used in [], so the solutions are exactly same as the fast sweeping methods. However, due to the hardware floating point implementation on different architectures (CPU and GPU), there is a small numerical difference between the solutions of those methods, but the difference is minimal and es not affect the quality of the extracted paths. Even though this paper focuses mainly on the computational aspect of the white matter pathway visualization, it is worth mentioning the pros and cons of the proposed method compared to the existing tractography methods. Global tractography gives interesting holistic visualizations of white matter architecture, which may be useful to the uninitiated. In contrast, the proposed method can provide a systematic method to query the quality of a particular path of interest, which is useful to experienced neuroscientists who already know the white matter architecture but wish to be able to easily and repeatably iden-
7 Appears in: Proc. IEEE Visualization, 00, pp. 0 Fig.. Tensor field visualization along the volumetric pathways using superquadric glyphs [] using the SCIRun software [?]. From left to right: a) tensor visualization; b) zoom in view near BCC. Fig.. Visualization of distance from a seed point. From left to right: a) Example : tensor elongated toward diagonal direction; b) Example : helix; c) Example : DT-MRI brain data. Fig.. Comparison between the proposed method and tractography method to extract the arcuate fasciculus connecting frontal and temporal cortex. Left : Volumetric path from the proposed method. Right : Paths from the tractography method. Yellow tted curve represents the arcuate fasciculus area.
8 Appears in: Proc. IEEE Visualization, 00, pp. 0 tify white matter circuitry across populations of subjects or patients. In addition, tractography is sensitive to noise and oblique shapes in DT-MRI, while the proposed method is robust to them. A nice example is the arcuate fasciculus, which connects Wernicke s and Broca s areas (frontal and temporal cortex) shown in figure. This tract is not easy to find because it crosses through some ambiguous regions as it descends to the temporal lobe (temporoparietal junction). Figure right shows a close up picture of a typical result from tractography that shows the difficulty of locating tracts that connect these two relatively small regions, especially where the alignment of the tensors become ambiguous. The tractography result ends abruptly, and none of the many thousands of tracks we seeded successfully connected these two regions. In contrast, the proposed method robustly finds the optimal path between the end points that minimizes the total cost value, which are much less affected by noise and ambiguity (figure left). CONCLUSION A fast method to compute and visualize white matter connectivity in DT-MRI volume using graphics hardware is presented. The proposed method computes the connectivity as the minimum distance from a given source region, and define the total cost by summing the connectivity value from each source region. The proposed method finds a volumetric optimal path as a set of voxels in the DTI volume that contain paths between two regions whose costs are within a threshold of the optimal path. To quickly compute the cost function, we introduce a novel GPU H-J solver, which runs roughly 0-00 times faster than existing CPU-based solvers, allowing users to freely change the endpoints of interesting pathways and to visualize the optimal volumetric path between them at an interactive rate. Introducing a fast volumetric connectivity extraction tool opens up numerous interesting future research directions. Because the GPU implementation of the FIM allows rapid computation of white matter connections, this makes computation of a full brain connectivity map feasible. This process could be automatically initialized with starting regions from a parcellation of the cortical surface, such as that produced by Freesurfer []. The proposed GPU H-J solver can be also applied to wider range of applications other than DT-MRI image analysis. For example, seismic wave propagation simulation in an anisotropic speed volume will be a direct application of the GPU H-J solver for geoscience research. Extensive performance analysis and comparison of the GPU solver with existing solvers will be another interesting future work. ACKNOWLEDGEMENTS This work is part of the National Alliance for Medical Image Computing (NAMIC), funded by the National Institutes of Health through the NIH Roadmap for Medical Research, Grant U EB00. This work has been supported in part by ExxonMobil Upstream Research Company. The visualizations in Figure and in this paper were produced with the BioPSE/SCIRun software package released by the Center for Integrative Biomedical Computing, NIH NCRR Project - P-RR-0 REFERENCES [] NVIDIA CUDA programming guide, cuda.html, 00. [] NVIDIA CUDA SDK, [] P. J. Basser, S. Pajevic, C. Pierpaoli, J. Duda, and A. Aldroubi. In-vivo fiber tractography using DT-MRI data. Magnetic Resonance in Medicine, :, 000. [] T. Behrens, M. Woolrich, M. Jenkinson, H. Johansen-Berg, R. Nunes, S. Clare, P. Matthews, J. Brady, and S. Smith. Characterization and propagation of uncertainty in diffusion-weighted MR imaging. Magnetic Resonance in Medicine, 0:0 0, 00. [] B. Fischl, A. van der Kouwe, C. Destrieux, E. Halgren, F. Sgonne, D. H. Salat, E. Busa, L. J. Seidman, J. Goldstein, D. Kennedy, V. Caviness, N. Makris, B. Rosen, and A. M. Dale. Automatically parcellating the human cerebral cortex. Cerebral Cortex, ():, 00. [] P. T. Fletcher, R. Tao, W.-K. Jeong, and R. T. Whitaker. A volumetric approach to quantifying region-to-region white matter connectivity in Difusion Tensor MRI. In Information Processing in Medical Imaging 00 Conference Proceedings (to appear), 00. [] K. E. Hoff III, J. Keyser, M. Lin, D. Manocha, and T. Culver. Fast computation of generalized Voronoi diagrams using graphics hardware. In SIGGRAPH Conference Proceedings, pages,. [] M. Jackowski, C. Y. Kao, M. Qiu, R. T. Constable, and L. H. Staib. Estimation of anatomical connectivity by anisotropic front propagation and diffusion tensor imaging. In MICCAI, pages, 00. [] C. Kao, S. Osher, and J. Qian. Lax-friedrichs sweeping scheme for static Hamilton-Jacobi equations. Journal of Computational Physics, ():, 00. [0] C. Kao, S. Osher, and Y. Tsai. Fast sweeping methods for static Hamilton- Jacobi equations. Technical report, Department of Mathematics, University of California, Los Angeles, 00. [] G. Kindlmann. Superquadric tensor glyphs. In Proceedings of IEEE TVCG/EG Symposium on Visualization 00, pages, May 00. [] M. A. Koch, D. G. Norris, and H.-G. M. An investigation of functional and anatomical connectivity using magnetic resonance imaging. NeuroImage, : 0, 00. [] M. Lazar and A. L. Alexander. Bootstrap white matter tractography (BOOT-TRAC). NeuroImage, :, 00. [] A. Lefohn, J. Kniss, C. Hansen, and R. Whitaker. Interactive deformation and visualization of level set surfaces using graphics hardware. In IEEE Visualization 00 Conference Proceedings, pages, 00. [] L. O Donnell, S. Haker, and C.-F. Westin. New approaches to estimation of white matter connectivity in diffusion tensor MRI: elliptic PDEs and geodesics in a tensor-warped space. In MICCAI, pages, 00. [] J. D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Krger, A. E. Lefohn, and T. J. Purcell. A survey of general-purpose computation on graphics hardware. Computer Graphics Forum, ():0, March 00. [] G. Parker, C. Wheeler-Kingshott, and G. Barker. Estimating distributed anatomical connectivity using fast marching methods and diffusion tensor imaging. Transactions on Medical Imaging, :0, 00. [] G. J. M. Parker, H. A. Haroon, and C. A. M. Wheeler-Kingshott. A framework for a streamline-based probabilistic index of connectivity (PICo) using a structural interpretation of MRI diffusion measurements. Journal of Magnetic Resonance Imaging, :, 00. [] E. Pichon, C.-F. Westin, and A. Tannenbaum. A Hamilton-Jacobi- Bellman approach to high angular resolution diffusion tractography. In MICCAI, pages 0, 00. [0] L. C. Polymenakos, D. P. Bertsekas, and J. N. Tsitsiklis. Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. Automatic Control, ():,. [] F. Qin, Y. Luo, K. Olsen, W. Cai, and G. Schuster. Finite-difference solution of the eikonal equation along expanding wavefronts. Geophysics, ():,. [] E. Rouy and A. Tourin. A viscosity solutions approach to shape-fromshading. SIAM Journal of Numerical Analysis, :,. [] J. Sethian. A fast marching level set method for monotonically advancing fronts. In Proc. Natl. Acad. Sci., volume, pages, February. [] J. Sethian. Fast marching methods. SIAM Review, ():,. [] J. A. Sethian and A. Vladimirsky. Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms. SIAM Journal of Numerical Analysis, ():, 00. [] C. Sigg, R. Peikert, and M. Gross. Signed distance transform using graphics hardware. In IEEE Visualization 00 Conference Proceedings, pages 0, 00. [] A. Sud, M. A. Otaduy, and D. Manocha. Difi: Fast d distance field computation using graphics hardware. Computer Graphics Forum, ():, 00. [] Y.-H. R. Tsai, L.-T. Cheng, S. Osher, and H.-K. Zhao. Fast sweeping algorithms for a class of Hamilton-Jacobi equations. SIAM Journal of Numerical Analysis, ():, 00. [] H. Zhao. A fast sweeping method for eikonal equations. Mathematics of Computation, :0, 00.
A Fast Iterative Method for a Class of Hamilton-Jacobi Equations on Parallel Systems
A ast Iterative Method for a Class of Hamilton-Jacobi Equations on Parallel Systems Won-Ki Jeong and Ross. Whitaker School of Computing, University of Utah April 18, 2007 Abstract In this paper we propose
Blood Particle Trajectories in Phase-Contrast-MRI as Minimal Paths Computed with Anisotropic Fast Marching
Blood Particle Trajectories in Phase-Contrast-MRI as Minimal Paths Computed with Anisotropic Fast Marching Michael Schwenke 1, Anja Hennemuth 1, Bernd Fischer 2, Ola Friman 1 1 Fraunhofer MEVIS, Institute
Diffusion Imaging Visualization
Diffusion Imaging Visualization Thomas Schultz URL: http://cg.cs.uni-bonn.de/schultz/ E-Mail: schultz@cs.uni-bonn.de 1 Outline Introduction to Diffusion Imaging Basic techniques Glyph-based Visualization
Evaluation of Local Filter Approaches for Diffusion Tensor based Fiber Tracking
Evaluation of Local Filter Approaches for Diffusion Tensor based Fiber Tracking D. Merhof 1, M. Buchfelder 2, C. Nimsky 3 1 Visual Computing, University of Konstanz, Konstanz 2 Department of Neurosurgery,
Fiber Selection from Diffusion Tensor Data based on Boolean Operators
Fiber Selection from Diffusion Tensor Data based on Boolean Operators D. Merhof 1, G. Greiner 2, M. Buchfelder 3, C. Nimsky 4 1 Visual Computing, University of Konstanz, Konstanz, Germany 2 Computer Graphics
NIH Public Access Author Manuscript Med Image Comput Comput Assist Interv. Author manuscript; available in PMC 2013 May 04.
NIH Public Access Author Manuscript Published in final edited form as: Med Image Comput Comput Assist Interv. 2005 ; 8(0 1): 180 187. A Hamilton-Jacobi-Bellman approach to high angular resolution diffusion
HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008
MIT OpenCourseWare http://ocw.mit.edu HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
NIH Public Access Author Manuscript Proc SPIE. Author manuscript; available in PMC 2012 October 10.
NIH Public Access Author Manuscript Published in final edited form as: Proc SPIE. 2011 ; 7962: 79620S. doi:10.1117/12.878291. Efficient, Graph-based White Matter Connectivity from Orientation Distribution
Acceleration of Probabilistic Tractography Using Multi-GPU Parallel Processing. Jungsoo Lee, Sun Mi Park, Dae-Shik Kim
Acceleration of Probabilistic Tractography Using Multi-GPU Parallel Processing Jungsoo Lee, Sun Mi Park, Dae-Shik Kim Introduction In particular, probabilistic tractography requires relatively long computation
Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes
Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes Dorit Merhof 1,2, Martin Meister 1, Ezgi Bingöl 1, Peter Hastreiter 1,2, Christopher Nimsky 2,3, Günther
FROM IMAGE RECONSTRUCTION TO CONNECTIVITY ANALYSIS: A JOURNEY THROUGH THE BRAIN'S WIRING. Francesca Pizzorni Ferrarese
FROM IMAGE RECONSTRUCTION TO CONNECTIVITY ANALYSIS: A JOURNEY THROUGH THE BRAIN'S WIRING Francesca Pizzorni Ferrarese Pipeline overview WM and GM Segmentation Registration Data reconstruction Tractography
A A14 A24 A34 A44 A45 A46
Computation of qp- and qs-wave Rays raveltimes Slowness Vector and Polarization in General Anisotropic Media Junwei Huang 1 * Juan M. Reyes-Montes 1 and R. Paul Young 2 1 Applied Seismology Consultants
Network connectivity via inference over curvature-regularizing line graphs
Network connectivity via inference over curvature-regularizing line graphs Asian Conference on Computer Vision Maxwell D. Collins 1,2, Vikas Singh 2,1, Andrew L. Alexander 3 1 Department of Computer Sciences
Laurent D. Cohen 2 CEREMADE, Université Paris Dauphine PARIS CEDEX 16 - FRANCE
The shading zone problem in geodesic voting and its solutions for the segmentation of tree structures. Application to the segmentation of Microglia extensions Youssef Rouchdy 1,2 University of Pennsylvania
HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008
MIT OpenCourseWare http://ocw.mit.edu HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
Fast marching methods
1 Fast marching methods Lecture 3 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Metric discretization 2 Approach I:
GEODESIC TRACTOGRAPHY SEGMENTATION FOR DIRECTIONAL MEDICAL IMAGE ANALYSIS
GEODESIC TRACTOGRAPHY SEGMENTATION FOR DIRECTIONAL MEDICAL IMAGE ANALYSIS A Dissertation Presented to The Academic Faculty by John Melonakos In Partial Fulfillment of the Requirements for the Degree Doctor
Fiber Selection from Diffusion Tensor Data based on Boolean Operators
Fiber Selection from Diffusion Tensor Data based on Boolean Operators D. Merhofl, G. Greiner 2, M. Buchfelder 3, C. Nimsky4 1 Visual Computing, University of Konstanz, Konstanz, Germany 2 Computer Graphics
Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm
Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm Lin Chen and Gudrun Wagenknecht Central Institute for Electronics, Research Center Jülich, Jülich, Germany Email: l.chen@fz-juelich.de
Fast Marching Methods (1) are numerical algorithms for
Fast methods for the Eikonal and related Hamilton Jacobi equations on unstructured meshes J. A. Sethian* and A. Vladimirsky Department of Mathematics, University of California, Berkeley, CA 94720 Communicated
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
Path Planning and Numerical Methods for Static (Time-Independent / Stationary) Hamilton-Jacobi Equations
Path Planning and Numerical Methods for Static (Time-Independent / Stationary) Hamilton-Jacobi Equations Ian Mitchell Department of Computer Science University of British Columbia Outline Path Planning
Uncertainty in White Matter Fiber Tractography
Uncertainty in White Matter Fiber Tractography Ola Friman and Carl-Fredrik Westin Laboratory of Mathematics in Imaging, Department of Radiology Brigham and Women s Hospital, Harvard Medical School Abstract.
Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations
Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations Simone Cacace 1, Emiliano Cristiani 2(B), and Maurizio Falcone 1 1 Dipartimento di Matematica, Sapienza Università di Roma, Rome,
Research Proposal: Computational Geometry with Applications on Medical Images
Research Proposal: Computational Geometry with Applications on Medical Images MEI-HENG YUEH yueh@nctu.edu.tw National Chiao Tung University 1 Introduction My research mainly focuses on the issues of computational
Physical-Space Refraction-Corrected Transmission Ultrasound Computed Tomography Made Computationally Practical
Physical-Space Refraction-Corrected Transmission Ultrasound Computed Tomography Made Computationally Practical 1 Shengying Li, 1 Klaus Mueller, 2 Marcel Jackowski, 3 Donald Dione, 4 Lawrence Staib 1 Stony
Diffusion model fitting and tractography: A primer
Diffusion model fitting and tractography: A primer Anastasia Yendiki HMS/MGH/MIT Athinoula A. Martinos Center for Biomedical Imaging 03/18/10 Why n how Diffusion model fitting and tractography 0/18 Why
Key words. Hamilton-Jacobi, Eikonal, viscosity solution, Fast Marching, Fast Sweeping
COMPUTATIONAL STUDY OF FAST METHODS FOR THE EIKONAL EQUATION PIERRE A. GREMAUD AND CHRISTOPHER M. KUSTER Abstract. A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal
Skåne University Hospital Lund, Lund, Sweden 2 Deparment of Numerical Analysis, Centre for Mathematical Sciences, Lund University, Lund, Sweden
Volume Tracking: A New Method for Visualization of Intracardiac Blood Flow from Three-Dimensional, Time-Resolved, Three-Component Magnetic Resonance Velocity Mapping Appendix: Theory and Numerical Implementation
Automatic Quantification of DTI Parameters along Fiber Bundles
Automatic Quantification of DTI Parameters along Fiber Bundles Jan Klein 1, Simon Hermann 1, Olaf Konrad 1, Horst K. Hahn 1, and Heinz-Otto Peitgen 1 1 MeVis Research, 28359 Bremen Email: klein@mevis.de
A Work-Efficient GPU Algorithm for Level Set Segmentation. Mike Roberts Jeff Packer Mario Costa Sousa Joseph Ross Mitchell
A Work-Efficient GPU Algorithm for Level Set Segmentation Mike Roberts Jeff Packer Mario Costa Sousa Joseph Ross Mitchell What do I mean by work-efficient? If a parallel algorithm performs asymptotically
Quantitative MRI of the Brain: Investigation of Cerebral Gray and White Matter Diseases
Quantities Measured by MR - Quantitative MRI of the Brain: Investigation of Cerebral Gray and White Matter Diseases Static parameters (influenced by molecular environment): T, T* (transverse relaxation)
8. Tensor Field Visualization
8. Tensor Field Visualization Tensor: extension of concept of scalar and vector Tensor data for a tensor of level k is given by t i1,i2,,ik (x 1,,x n ) Second-order tensor often represented by matrix Examples:
NEURO M203 & BIOMED M263 WINTER 2014
NEURO M203 & BIOMED M263 WINTER 2014 MRI Lab 2: Neuroimaging Connectivity Lab In today s lab we will work with sample diffusion imaging data and the group averaged fmri data collected during your scanning
Ordered upwind methods for static Hamilton Jacobi equations
Ordered upwind methods for static Hamilton Jacobi equations J. A. Sethian* and A. Vladimirsky Department of Mathematics, University of California, Berkeley, CA 94720 Edited by Alexandre J. Chorin, University
DiFi: Distance Fields - Fast Computation Using Graphics Hardware
DiFi: Distance Fields - Fast Computation Using Graphics Hardware Avneesh Sud Dinesh Manocha UNC-Chapel Hill http://gamma.cs.unc.edu/difi Distance Fields Distance Function For a site a scalar function f:r
Numerical schemes for Hamilton-Jacobi equations, control problems and games
Numerical schemes for Hamilton-Jacobi equations, control problems and games M. Falcone H. Zidani SADCO Spring School Applied and Numerical Optimal Control April 23-27, 2012, Paris Lecture 2/3 M. Falcone
Automatic Quantification of DTI Parameters along Fiber Bundles
Automatic Quantification of DTI Parameters along Fiber Bundles Jan Klein, Simon Hermann, Olaf Konrad, Horst K. Hahn, Heinz-Otto Peitgen MeVis Research, 28359 Bremen Email: klein@mevis.de Abstract. We introduce
The organization of the human cerebral cortex estimated by intrinsic functional connectivity
1 The organization of the human cerebral cortex estimated by intrinsic functional connectivity Journal: Journal of Neurophysiology Author: B. T. Thomas Yeo, et al Link: https://www.ncbi.nlm.nih.gov/pubmed/21653723
William Yang Group 14 Mentor: Dr. Rogerio Richa Visual Tracking of Surgical Tools in Retinal Surgery using Particle Filtering
Mutual Information Computation and Maximization Using GPU Yuping Lin and Gérard Medioni Computer Vision and Pattern Recognition Workshops (CVPR) Anchorage, AK, pp. 1-6, June 2008 Project Summary and Paper
The Level Set Method. Lecture Notes, MIT J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations
The Level Set Method Lecture Notes, MIT 16.920J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations Per-Olof Persson persson@mit.edu March 7, 2005 1 Evolving Curves and Surfaces Evolving
NIH Public Access Author Manuscript Proc Soc Photo Opt Instrum Eng. Author manuscript; available in PMC 2014 October 07.
NIH Public Access Author Manuscript Published in final edited form as: Proc Soc Photo Opt Instrum Eng. 2014 March 21; 9034: 903442. doi:10.1117/12.2042915. MRI Brain Tumor Segmentation and Necrosis Detection
Atelier 2 : Calcul Haute Performance et Sciences du Vivant Forum er juillet, Paris, France
From Diffusion MR Image Analysis to Whole Brain Connectivity Simulation Jean-Philippe Thiran EPFL Lausanne, Switzerland EPFL - Lausanne HPC in life sciences at EPFL The Blue Brain project: create a biologically
DIFFUSION TENSOR IMAGING ANALYSIS. Using Analyze
DIFFUSION TENSOR IMAGING ANALYSIS Using Analyze 2 Table of Contents 1. Introduction page 3 2. Loading DTI Data page 4 3. Computing DTI Maps page 5 4. Defining ROIs for Fiber Tracking page 6 5. Visualizing
Group Statistics of DTI Fiber Bundles Using Spatial Functions of Tensor Measures
Group Statistics of DTI Fiber Bundles Using Spatial Functions of Tensor Measures Casey B. Goodlett 1,2, P. Thomas Fletcher 1,2, John H. Gilmore 3, and Guido Gerig 1,2 1 School of Computing, University
Geometric Multigrid on Multicore Architectures: Performance-Optimized Complex Diffusion
Geometric Multigrid on Multicore Architectures: Performance-Optimized Complex Diffusion M. Stürmer, H. Köstler, and U. Rüde Lehrstuhl für Systemsimulation Friedrich-Alexander-Universität Erlangen-Nürnberg
Large scale Imaging on Current Many- Core Platforms
Large scale Imaging on Current Many- Core Platforms SIAM Conf. on Imaging Science 2012 May 20, 2012 Dr. Harald Köstler Chair for System Simulation Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen,
Outline. Level Set Methods. For Inverse Obstacle Problems 4. Introduction. Introduction. Martin Burger
For Inverse Obstacle Problems Martin Burger Outline Introduction Optimal Geometries Inverse Obstacle Problems & Shape Optimization Sensitivity Analysis based on Gradient Flows Numerical Methods University
High order fast sweeping methods for static Hamilton-Jacobi equations
High order fast sweeping methods for static Hamilton-Jacobi equations Yong-Tao Zhang, Hong-Kai Zhao and Jianliang Qian 3 ABSTRACT We construct high order fast sweeping numerical methods for computing viscosity
A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TRIANGULATED SURFACES
SIAM J. SCI. COMPUT. Vol. 33, No. 5, pp. 2468 2488 c 2011 Society for Industrial and Applied Mathematics A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TRIANGULATED SURFACES ZHISONG FU, WON-KI
Fast Interactive Region of Interest Selection for Volume Visualization
Fast Interactive Region of Interest Selection for Volume Visualization Dominik Sibbing and Leif Kobbelt Lehrstuhl für Informatik 8, RWTH Aachen, 20 Aachen Email: {sibbing,kobbelt}@informatik.rwth-aachen.de
Shortest-path calculation of first arrival traveltimes by expanding wavefronts
Stanford Exploration Project, Report 82, May 11, 2001, pages 1 144 Shortest-path calculation of first arrival traveltimes by expanding wavefronts Hector Urdaneta and Biondo Biondi 1 ABSTRACT A new approach
IMA Preprint Series # 2021
O(N) IMPLEMENTATION OF THE FAST MARCHING ALGORITHM By Liron Yatziv Alberto Bartesaghi and Guillermo Sapiro IMA Preprint Series # 2021 ( February 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS UNIVERSITY
B. Tech. Project Second Stage Report on
B. Tech. Project Second Stage Report on GPU Based Active Contours Submitted by Sumit Shekhar (05007028) Under the guidance of Prof Subhasis Chaudhuri Table of Contents 1. Introduction... 1 1.1 Graphic
Consider a problem in which we are given a speed function
AQ: A AQ: B Fn1 Fast marching methods for the continuous traveling salesman problem June Andrews and J. A. Sethian* Department of Mathematics, University of California, Berkeley, CA 94720 Communicated
Data parallel algorithms, algorithmic building blocks, precision vs. accuracy
Data parallel algorithms, algorithmic building blocks, precision vs. accuracy Robert Strzodka Architecture of Computing Systems GPGPU and CUDA Tutorials Dresden, Germany, February 25 2008 2 Overview Parallel
A method of visualization of a brain neural pathway by using critical points and target regions
Modelling in Medicine and Biology VII 309 A method of visualization of a brain neural pathway by using critical points and target regions A. Doi 1, H. Fujimura 2, M. Nagano 1, T. Inoue 3 & A. Ogawa 3 1
A Recursive Anisotropic Fast Marching Approach to Reaction Diffusion Equation: Application to Tumor Growth Modeling
A Recursive Anisotropic Fast Marching Approach to Reaction Diffusion Equation: Application to Tumor Growth Modeling Ender Konukoglu, Maxime Sermesant, Olivier Clatz, Jean-Marc Peyrat, Hervé Delingette,
An Efficient, Geometric Multigrid Solver for the Anisotropic Diffusion Equation in Two and Three Dimensions
1 n Efficient, Geometric Multigrid Solver for the nisotropic Diffusion Equation in Two and Three Dimensions Tolga Tasdizen, Ross Whitaker UUSCI-2004-002 Scientific Computing and Imaging Institute University
Level-set MCMC Curve Sampling and Geometric Conditional Simulation
Level-set MCMC Curve Sampling and Geometric Conditional Simulation Ayres Fan John W. Fisher III Alan S. Willsky February 16, 2007 Outline 1. Overview 2. Curve evolution 3. Markov chain Monte Carlo 4. Curve
Graph-Shifts Anatomic 3D Segmentation by Dynamic Hierarchical Minimization
Graph-Shifts Anatomic 3D Segmentation by Dynamic Hierarchical Minimization Jason Corso Postdoctoral Fellow UCLA LONI/CCB jcorso@ucla.edu Motivation The work deals with the problem of automatically labeling
Diffusion Tensor Processing and Visualization
NA-MIC National Alliance for Medical Image Computing http://na-mic.org Diffusion Tensor Processing and Visualization Guido Gerig University of Utah Martin Styner, UNC NAMIC: National Alliance for Medical
Interactive, GPU-Based Level Sets for 3D Segmentation
Interactive, GPU-Based Level Sets for 3D Segmentation Aaron E. Lefohn, Joshua E. Cates, and Ross T. Whitaker Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT 84112 {lefohn,
Reconstruction of Fiber Trajectories via Population-Based Estimation of Local Orientations
IDEA Reconstruction of Fiber Trajectories via Population-Based Estimation of Local Orientations Pew-Thian Yap, John H. Gilmore, Weili Lin, Dinggang Shen Email: ptyap@med.unc.edu 2011-09-21 Poster: P2-46-
n o r d i c B r a i n E x Tutorial DTI Module
m a k i n g f u n c t i o n a l M R I e a s y n o r d i c B r a i n E x Tutorial DTI Module Please note that this tutorial is for the latest released nordicbrainex. If you are using an older version please
June Wesley, Cambridge Univ. Press,
[6] P Dupuis and J Oliensis. An optimal control formulation and related numerical methods for a problem in shape reconstruction. Ann. Appl. Probab., 4():87{ 346, 994. [7] B K P Horn. Obtaining shape from
syngo.mr Neuro 3D: Your All-In-One Post Processing, Visualization and Reporting Engine for BOLD Functional and Diffusion Tensor MR Imaging Datasets
syngo.mr Neuro 3D: Your All-In-One Post Processing, Visualization and Reporting Engine for BOLD Functional and Diffusion Tensor MR Imaging Datasets Julien Gervais; Lisa Chuah Siemens Healthcare, Magnetic
Dynamic Programming Algorithms for Planning and Robotics in Continuous Domains and the Hamilton-Jacobi Equation
Dynamic Programming Algorithms for Planning and Robotics in Continuous Domains and the Hamilton-Jacobi Equation Ian Mitchell Department of Computer Science University of British Columbia research supported
smooth coefficients H. Köstler, U. Rüde
A robust multigrid solver for the optical flow problem with non- smooth coefficients H. Köstler, U. Rüde Overview Optical Flow Problem Data term and various regularizers A Robust Multigrid Solver Galerkin
Knowledge-Based Segmentation of Brain MRI Scans Using the Insight Toolkit
Knowledge-Based Segmentation of Brain MRI Scans Using the Insight Toolkit John Melonakos 1, Ramsey Al-Hakim 1, James Fallon 2 and Allen Tannenbaum 1 1 Georgia Institute of Technology, Atlanta GA 30332,
A Ray-based Approach for Boundary Estimation of Fiber Bundles Derived from Diffusion Tensor Imaging
A Ray-based Approach for Boundary Estimation of Fiber Bundles Derived from Diffusion Tensor Imaging M. H. A. Bauer 1,3, S. Barbieri 2, J. Klein 2, J. Egger 1,3, D. Kuhnt 1, B. Freisleben 3, H.-K. Hahn
Comparison of the Parallel Fast Marching Method, the Fast Iterative Method, and the Parallel Semi-Ordered Fast Iterative Method
Procedia Computer Science Volume 0, 06, Pages 7 75 ICCS 06. The International Conference on Computational Science Comparison of the Parallel Fast Marching Method, the Fast Iterative Method, and the Parallel
Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations
Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations Simone Cacace, Emiliano Cristiani, Maurizio Falcone To cite this version: Simone Cacace, Emiliano Cristiani, Maurizio Falcone. Two
Neural Network-Assisted Fiber Tracking of Synthetic and White Matter DT-MR Images
Neural Network-Assisted Fiber Tracking of Synthetic and White Matter DT-MR Images L.M. San-José-Revuelta, M. Martín-Fernández and C. Alberola-López Abstract In this paper, a recently developed fiber tracking
Subvoxel Segmentation and Representation of Brain Cortex Using Fuzzy Clustering and Gradient Vector Diffusion
Subvoxel Segmentation and Representation of Brain Cortex Using Fuzzy Clustering and Gradient Vector Diffusion Ming-Ching Chang Xiaodong Tao GE Global Research Center {changm, taox} @ research.ge.com SPIE
MR Diffusion-Based Inference of a Fiber Bundle Model from a Population of Subjects
MR Diffusion-Based Inference of a Fiber Bundle Model from a Population of Subjects V. El Kouby 1,3, Y. Cointepas 1,3, C. Poupon 1,3, D. Rivière 1,3, N. Golestani 1,2, J.-B. Poline 4, D. Le Bihan 1,3, and
COMP30019 Graphics and Interaction Scan Converting Polygons and Lines
COMP30019 Graphics and Interaction Scan Converting Polygons and Lines Department of Computer Science and Software Engineering The Lecture outline Introduction Scan conversion Scan-line algorithm Edge coherence
Open Topology: A Toolkit for Brain Isosurface Correction
Open Topology: A Toolkit for Brain Isosurface Correction Sylvain Jaume 1, Patrice Rondao 2, and Benoît Macq 2 1 National Institute of Research in Computer Science and Control, INRIA, France, sylvain@mit.edu,
Complex Fiber Visualization
Annales Mathematicae et Informaticae 34 (2007) pp. 103 109 http://www.ektf.hu/tanszek/matematika/ami Complex Fiber Visualization Henrietta Tomán a, Róbert Tornai b, Marianna Zichar c a Department of Computer
Conformal Flattening ITK Filter
=1 Conformal Flattening ITK Filter Release 0.00 Yi Gao 1, John Melonakos 1, and Allen Tannenbaum 1 July 22, 2006 1 Georgia Institute of Technology, Atlanta, GA Abstract This paper describes the Insight
Neuroimaging and mathematical modelling Lesson 2: Voxel Based Morphometry
Neuroimaging and mathematical modelling Lesson 2: Voxel Based Morphometry Nivedita Agarwal, MD Nivedita.agarwal@apss.tn.it Nivedita.agarwal@unitn.it Volume and surface morphometry Brain volume White matter
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping Emmanuel Prados, Christophe Lenglet, Jean-Philippe Pons, Nicolas Wotawa, Rachid Deriche, Olivier Faugeras, Stefano Soatto To cite
The determination of the correct
SPECIAL High-performance SECTION: H i gh-performance computing computing MARK NOBLE, Mines ParisTech PHILIPPE THIERRY, Intel CEDRIC TAILLANDIER, CGGVeritas (formerly Mines ParisTech) HENRI CALANDRA, Total
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 17, NO. 5, MAY
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 17, NO. 5, MAY 2008 645 A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution Yonggang Shi, Member, IEEE, and William Clem Karl, Senior
REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT
REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT Anand P Santhanam Assistant Professor, Department of Radiation Oncology OUTLINE Adaptive radiotherapy for head and
A Method for Registering Diffusion Weighted Magnetic Resonance Images
A Method for Registering Diffusion Weighted Magnetic Resonance Images Xiaodong Tao and James V. Miller GE Research, Niskayuna, New York, USA Abstract. Diffusion weighted magnetic resonance (DWMR or DW)
Technische Universiteit Eindhoven Department of Mathematics and Computer Science. Master s Thesis HIERARCHICAL VISUALIZATION USING FIBER CLUSTERING
Technische Universiteit Eindhoven Department of Mathematics and Computer Science Master s Thesis HIERARCHICAL VISUALIZATION USING FIBER CLUSTERING by Ing. B. Moberts Supervisors: Dr. A. Vilanova Prof.dr.ir.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces. joint work with (S. Osher, R. Fedkiw and M. Kang) Desired properties for surface reconstruction:
Metrics for Uncertainty Analysis and Visualization of Diffusion Tensor Images
Metrics for Uncertainty Analysis and Visualization of Diffusion Tensor Images Fangxiang Jiao 1, Jeff M. Phillips 2, Jeroen Stinstra 3, Jens Krger 4, Raj Varma 2, Edward HSU 5, Julie Korenberg 6, and Chris
Institute of Cardiovascular Science, UCL Centre for Cardiovascular Imaging, London, United Kingdom, 2
Grzegorz Tomasz Kowalik 1, Jennifer Anne Steeden 1, Bejal Pandya 1, David Atkinson 2, Andrew Taylor 1, and Vivek Muthurangu 1 1 Institute of Cardiovascular Science, UCL Centre for Cardiovascular Imaging,
Lilla Zöllei A.A. Martinos Center, MGH; Boston, MA
Lilla Zöllei lzollei@nmr.mgh.harvard.edu A.A. Martinos Center, MGH; Boston, MA Bruce Fischl Gheorghe Postelnicu Jean Augustinack Anastasia Yendiki Allison Stevens Kristen Huber Sita Kakonoori + the FreeSurfer
CSC Computer Graphics
// CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.lk Department of Computer Science University of Sri Jayewardanepura Polygon Filling Scan-Line Polygon Fill Algorithm Span Flood-Fill Algorithm Inside-outside
CHAPTER 2. Morphometry on rodent brains. A.E.H. Scheenstra J. Dijkstra L. van der Weerd
CHAPTER 2 Morphometry on rodent brains A.E.H. Scheenstra J. Dijkstra L. van der Weerd This chapter was adapted from: Volumetry and other quantitative measurements to assess the rodent brain, In vivo NMR
Algebraic Methods for Direct and Feature Based Registration of Diffusion Tensor Images
Algebraic Methods for Direct and Feature Based Registration of Diffusion Tensor Images Alvina Goh and René Vidal Center for Imaging Science, Department of BME, Johns Hopkins University 308B Clark Hall,
Abstract. Introduction. Kevin Todisco
- Kevin Todisco Figure 1: A large scale example of the simulation. The leftmost image shows the beginning of the test case, and shows how the fluid refracts the environment around it. The middle image
High-Order Finite-Element Earthquake Modeling on very Large Clusters of CPUs or GPUs
High-Order Finite-Element Earthquake Modeling on very Large Clusters of CPUs or GPUs Gordon Erlebacher Department of Scientific Computing Sept. 28, 2012 with Dimitri Komatitsch (Pau,France) David Michea
The GPGPU Programming Model
The Programming Model Institute for Data Analysis and Visualization University of California, Davis Overview Data-parallel programming basics The GPU as a data-parallel computer Hello World Example Programming
Spatial Regularization of Functional Connectivity Using High-Dimensional Markov Random Fields
Spatial Regularization of Functional Connectivity Using High-Dimensional Markov Random Fields Wei Liu 1, Peihong Zhu 1, Jeffrey S. Anderson 2, Deborah Yurgelun-Todd 3, and P. Thomas Fletcher 1 1 Scientific
Center for Computational Science
Center for Computational Science Toward GPU-accelerated meshfree fluids simulation using the fast multipole method Lorena A Barba Boston University Department of Mechanical Engineering with: Felipe Cruz,
Image Segmentation. Ross Whitaker SCI Institute, School of Computing University of Utah
Image Segmentation Ross Whitaker SCI Institute, School of Computing University of Utah What is Segmentation? Partitioning images/volumes into meaningful pieces Partitioning problem Labels Isolating a specific