Visualizing white matter structure of the brain using Dijkstra's algorithm

Maarten H. Everts; Henk Bekker; Jos B.T.M. Roerdink

doi:10.1109/ISPA.2009.5297652

Visualizing white matter structure of the brain using Dijkstra's algorithm

Maarten H. Everts
, Henk Bekker
, Jos B.T.M. Roerdink

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

5 Citations (Scopus)

Abstract

An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating trajectories of fiber bundles in the brain by applying Dijkstra's shortest path algorithm to the weighted graph. Subsequently, the resulting tree structure is pruned, showing the main white matter structures of the brain. The time consumption of this method is in the order of seconds.

Original language	English
Title of host publication	ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis
Place of Publication	Piscataway, NJ
Publisher	IEEE
Pages	569-574
Number of pages	6
ISBN (Print)	978-953-184-134-4 (CD), 978-953-184-135-1
DOIs	https://doi.org/10.1109/ISPA.2009.5297652
Publication status	Published - 2009
Externally published	Yes
Event	6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009 - Salzburg, Austria Duration: 16 Sept 2009 → 18 Sept 2009 Conference number: 6

Publication series

Name	Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)
Publisher	IEEE
Number	6
Volume	2009
ISSN (Print)	1845-5921

Conference

Conference	6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009
Abbreviated title	ISPA 2009
Country/Territory	Austria
City	Salzburg
Period	16/09/09 → 18/09/09

Keywords

Tensile stress
Data visualization
Joining processes
Nerve fibers
Magnetic resonance imaging
Diffusion tensor imaging
Iterative algorithms
Mathematics
Optical fiber testing
Tree data structures
n/a OA procedure

Access to Document

10.1109/ISPA.2009.5297652

Cite this

Everts, M. H., Bekker, H., & Roerdink, J. B. T. M. (2009). Visualizing white matter structure of the brain using Dijkstra's algorithm. In ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis (pp. 569-574). Article 5297652 (Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA); Vol. 2009, No. 6). IEEE. https://doi.org/10.1109/ISPA.2009.5297652

Everts, Maarten H. ; Bekker, Henk ; Roerdink, Jos B.T.M. / Visualizing white matter structure of the brain using Dijkstra's algorithm. ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis. Piscataway, NJ : IEEE, 2009. pp. 569-574 (Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA); 6).

@inproceedings{09df9a2b1a6649f8beab403d06b7b81c,

title = "Visualizing white matter structure of the brain using Dijkstra's algorithm",

abstract = "An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating trajectories of fiber bundles in the brain by applying Dijkstra's shortest path algorithm to the weighted graph. Subsequently, the resulting tree structure is pruned, showing the main white matter structures of the brain. The time consumption of this method is in the order of seconds.",

keywords = "Tensile stress, Data visualization, Joining processes, Nerve fibers, Magnetic resonance imaging, Diffusion tensor imaging, Iterative algorithms, Mathematics, Optical fiber testing, Tree data structures, n/a OA procedure",

author = "Everts, \{Maarten H.\} and Henk Bekker and Roerdink, \{Jos B.T.M.\}",

year = "2009",

doi = "10.1109/ISPA.2009.5297652",

language = "English",

isbn = "978-953-184-134-4 (CD)",

series = "Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)",

publisher = "IEEE",

number = "6",

pages = "569--574",

booktitle = "ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis",

address = "United States",

note = "6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009, ISPA 2009 ; Conference date: 16-09-2009 Through 18-09-2009",

}

Everts, MH, Bekker, H & Roerdink, JBTM 2009, Visualizing white matter structure of the brain using Dijkstra's algorithm. in ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis., 5297652, Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA), no. 6, vol. 2009, IEEE, Piscataway, NJ, pp. 569-574, 6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009, Salzburg, Austria, 16/09/09. https://doi.org/10.1109/ISPA.2009.5297652

Visualizing white matter structure of the brain using Dijkstra's algorithm. / Everts, Maarten H.; Bekker, Henk; Roerdink, Jos B.T.M.
ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis. Piscataway, NJ: IEEE, 2009. p. 569-574 5297652 (Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA); Vol. 2009, No. 6).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Visualizing white matter structure of the brain using Dijkstra's algorithm

AU - Everts, Maarten H.

AU - Bekker, Henk

AU - Roerdink, Jos B.T.M.

N1 - Conference code: 6

PY - 2009

Y1 - 2009

N2 - An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating trajectories of fiber bundles in the brain by applying Dijkstra's shortest path algorithm to the weighted graph. Subsequently, the resulting tree structure is pruned, showing the main white matter structures of the brain. The time consumption of this method is in the order of seconds.

AB - An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating trajectories of fiber bundles in the brain by applying Dijkstra's shortest path algorithm to the weighted graph. Subsequently, the resulting tree structure is pruned, showing the main white matter structures of the brain. The time consumption of this method is in the order of seconds.

KW - Tensile stress

KW - Data visualization

KW - Joining processes

KW - Nerve fibers

KW - Magnetic resonance imaging

KW - Diffusion tensor imaging

KW - Iterative algorithms

KW - Mathematics

KW - Optical fiber testing

KW - Tree data structures

KW - n/a OA procedure

UR - https://www.scopus.com/pages/publications/70450285244

U2 - 10.1109/ISPA.2009.5297652

DO - 10.1109/ISPA.2009.5297652

M3 - Conference contribution

AN - SCOPUS:70450285244

SN - 978-953-184-134-4 (CD)

SN - 978-953-184-135-1

T3 - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)

SP - 569

EP - 574

BT - ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis

PB - IEEE

CY - Piscataway, NJ

T2 - 6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009

Y2 - 16 September 2009 through 18 September 2009

ER -

Everts MH, Bekker H, Roerdink JBTM. Visualizing white matter structure of the brain using Dijkstra's algorithm. In ISPA 2009 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis. Piscataway, NJ: IEEE. 2009. p. 569-574. 5297652. (Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA); 6). doi: 10.1109/ISPA.2009.5297652

Visualizing white matter structure of the brain using Dijkstra's algorithm

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this