Publication:
Kruskal's minimum spanning tree approach to brain fiber tractography computation [Beyin fiber traktografi hesaplamalarinda kruskal asgari tarama aǧaci yaklaşimi]

Simple item page
dc.contributor.authorsDura D.G., Deniz Duru A.
dc.date.accessioned2022-03-15T02:10:25Z
dc.date.accessioned2026-01-10T21:02:04Z
dc.date.available2022-03-15T02:10:25Z
dc.date.issued2014
dc.description.abstractKruskal's minimum spanning tree algorithm is a graph algorithm which constructs the tree with the minimum total edge length. The starting node of the tree generated by Kruskal's algorithm is not important. This is an advantage in diffusion tensor fiber analysis. In this study, a tractography approach, which does not depend on user selection, independent from a starting node, covers the whole region of interest, and calculates all the connectivity, is proposed. In this diffusion tensor tractography study, the advantages and limitations of the Kruskal's minimum spanning tree method are discussed, and a tractography algorithm based on this approach is developed. © 2014 IEEE.
dc.identifier.doi10.1109/SIU.2014.6830556
dc.identifier.isbn9781479948741
dc.identifier.urihttps://hdl.handle.net/11424/247496
dc.language.isotur
dc.publisherIEEE Computer Society
dc.relation.ispartof2014 22nd Signal Processing and Communications Applications Conference, SIU 2014 - Proceedings
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectdiffusion tensor
dc.subjectKruskal's minimum spanning tree
dc.subjecttractography
dc.titleKruskal's minimum spanning tree approach to brain fiber tractography computation [Beyin fiber traktografi hesaplamalarinda kruskal asgari tarama aǧaci yaklaşimi]
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage1626
oaire.citation.startPage1624
oaire.citation.title2014 22nd Signal Processing and Communications Applications Conference, SIU 2014 - Proceedings

Files

Collections

Araştırma Çıktıları