Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2503.07104 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910867031851008 |
|---|---|
| author | von Bornhaupt, Valentin Grün, Johannes Bisten, and Justus Bauer, Tobias Rüber, Theodor Schultz, Thomas |
| author_facet | von Bornhaupt, Valentin Grün, Johannes Bisten, and Justus Bauer, Tobias Rüber, Theodor Schultz, Thomas |
| contents | Whole-brain tractography in diffusion MRI is often followed by a parcellation in which each streamline is classified as belonging to a specific white matter bundle, or discarded as a false positive. Efficient parcellation is important both in large-scale studies, which have to process huge amounts of data, and in the clinic, where computational resources are often limited. TractCloud is a state-of-the-art approach that aims to maximize accuracy with a local-global representation. We demonstrate that the local context does not contribute to the accuracy of that approach, and is even detrimental when dealing with pathological cases. Based on this observation, we propose PETParc, a new method for Parallel Efficient Tractography Parcellation. PETParc is a transformer-based architecture in which the whole-brain tractogram is randomly partitioned into sub-tractograms whose streamlines are classified in parallel, while serving as global context for each other. This leads to a speedup of up to two orders of magnitude relative to TractCloud, and permits inference even on clinical workstations without a GPU. PETParc accounts for the lack of streamline orientation either via a novel flip-invariant embedding, or by simply using flips as part of data augmentation. Despite the speedup, results are often even better than those of prior methods. The code and pretrained model will be made public upon acceptance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_07104 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Global Context Is All You Need for Parallel Efficient Tractography Parcellation von Bornhaupt, Valentin Grün, Johannes Bisten, and Justus Bauer, Tobias Rüber, Theodor Schultz, Thomas Image and Video Processing Computer Vision and Pattern Recognition Machine Learning Quantitative Methods 68T10, 92C55, 65Y05, 68U10 I.4.8; I.5.4; J.3; C.1.4; I.2.6 Whole-brain tractography in diffusion MRI is often followed by a parcellation in which each streamline is classified as belonging to a specific white matter bundle, or discarded as a false positive. Efficient parcellation is important both in large-scale studies, which have to process huge amounts of data, and in the clinic, where computational resources are often limited. TractCloud is a state-of-the-art approach that aims to maximize accuracy with a local-global representation. We demonstrate that the local context does not contribute to the accuracy of that approach, and is even detrimental when dealing with pathological cases. Based on this observation, we propose PETParc, a new method for Parallel Efficient Tractography Parcellation. PETParc is a transformer-based architecture in which the whole-brain tractogram is randomly partitioned into sub-tractograms whose streamlines are classified in parallel, while serving as global context for each other. This leads to a speedup of up to two orders of magnitude relative to TractCloud, and permits inference even on clinical workstations without a GPU. PETParc accounts for the lack of streamline orientation either via a novel flip-invariant embedding, or by simply using flips as part of data augmentation. Despite the speedup, results are often even better than those of prior methods. The code and pretrained model will be made public upon acceptance. |
| title | Global Context Is All You Need for Parallel Efficient Tractography Parcellation |
| topic | Image and Video Processing Computer Vision and Pattern Recognition Machine Learning Quantitative Methods 68T10, 92C55, 65Y05, 68U10 I.4.8; I.5.4; J.3; C.1.4; I.2.6 |
| url | https://arxiv.org/abs/2503.07104 |