Visualizing the brain structure with a DT-MRI minimum spanning tree

نویسنده

  • Prompong Pakawanwong
چکیده

Visualizing the human brain using diffusion tensor magnetic resonance imaging (DT-MRI) data has been a key technique to study the structure of the human brain and its connectivity. The challenge is to find a method that best exploits the data and serves as a model for visualization and connectivity analysis. This paper presents a novel method of visualizing the human brain structure with a minimum spanning tree using DT-MRI data. The human brain is modeled as a graph in which each vertex represents a brain voxel and each edge represents connectivity between a pair of neighboring brain voxels, resulting in each vertex having 26 weighted connections with adjacent voxels. The weight of an edge is calculated from the DT-MRI data with a higher weight assigned to an edge that are more likely aligned with nerve fiber trajectories. The method then grows a minimum spanning tree representing paths of the nerve fiber bundles. The resultant minimum spanning tree is consistent with the known anatomical appearances of the human brain. As the minimum spanning tree representing the human brain is a global deterministic model with well-defined connectivity between voxels in the brain, it can serve not only as a deterministic visualization of the human brain but also as an instrument for connectivity analysis. In addition, this method overcomes several problems present in previous methods such as tracking termination in traditional fiber tracking and meaningless streamlines in stochastic connectivity mapping.

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

ثبت نام

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

منابع مشابه

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

DT-MRI Tractography and its Application in Cognitive Neuroscience

Recent advancement of MRI techniques and development of new methods of image analysis have allowed us to study large neural tracts within the human brain. This is based on the principle of diffusion tensor MRI that is similar to that of diffusion-weighted imaging but takes magnitude and direction of the diffusion of water into account. Using this technique we have been able to define large neur...

متن کامل

A Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks

There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...

متن کامل

DT-MRI Tractography and its Application in Cognitive Neuroscience

Recent advancement of MRI techniques and development of new methods of image analysis have allowed us to study large neural tracts within the human brain. This is based on the principle of diffusion tensor MRI that is similar to that of diffusion-weighted imaging but takes magnitude and direction of the diffusion of water into account. Using this technique we have been able to define large neur...

متن کامل

Minimum Restricted Diameter Spanning Trees

Let G = (V,E) be a requirements graph. Let d = (dij)i,j=1 be a length metric. For a tree T denote by dT (i, j) the distance between i and j in T (the length according to d of the unique i − j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices with requirement between them. The minimum restricted diameter spanning tree problem is to find a span...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2015