Fast Streamline Search: An Exact Technique for Diffusion MRI Tractography
In this work, a hierarchical search algorithm is proposed to efficiently compute the distance between similar tractography streamlines. This hierarchical framework offers an upper bound and a lower bound for the point-wise distance between two streamlines, which guarantees the validity of a proximit...
Saved in:
| Published in | Neuroinformatics (Totowa, N.J.) Vol. 20; no. 4; pp. 1093 - 1104 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.10.2022
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1539-2791 1559-0089 1559-0089 |
| DOI | 10.1007/s12021-022-09590-7 |
Cover
| Summary: | In this work, a hierarchical search algorithm is proposed to efficiently compute the distance between similar tractography streamlines. This hierarchical framework offers an upper bound and a lower bound for the point-wise distance between two streamlines, which guarantees the validity of a proximity search. The proposed streamline representation enables the use of space-partitioning search trees to increase the tractography clustering speed without reducing its accuracy. The resulting approach enables a fast reconstruction a sparse distance matrix between two sets of streamlines, for all similar streamlines within a given radius. Alongside a white matter atlas, this
fast streamline search
can be used for accurate and reproducible tractogram clustering. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1539-2791 1559-0089 1559-0089 |
| DOI: | 10.1007/s12021-022-09590-7 |