Cargando…

Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)

PURPOSE: To develop a rapid and accurate MRI phase‐unwrapping technique for challenging phase topographies encountered at high magnetic fields, around metal implants, or postoperative cavities, which is sufficiently fast to be applied to large‐group studies including Quantitative Susceptibility Mapp...

Descripción completa

Detalles Bibliográficos
Autores principales: Dymerska, Barbara, Eckstein, Korbinian, Bachrata, Beata, Siow, Bernard, Trattnig, Siegfried, Shmueli, Karin, Robinson, Simon Daniel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: John Wiley and Sons Inc. 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7821134/
https://www.ncbi.nlm.nih.gov/pubmed/33104278
http://dx.doi.org/10.1002/mrm.28563
_version_ 1783639352636604416
author Dymerska, Barbara
Eckstein, Korbinian
Bachrata, Beata
Siow, Bernard
Trattnig, Siegfried
Shmueli, Karin
Robinson, Simon Daniel
author_facet Dymerska, Barbara
Eckstein, Korbinian
Bachrata, Beata
Siow, Bernard
Trattnig, Siegfried
Shmueli, Karin
Robinson, Simon Daniel
author_sort Dymerska, Barbara
collection PubMed
description PURPOSE: To develop a rapid and accurate MRI phase‐unwrapping technique for challenging phase topographies encountered at high magnetic fields, around metal implants, or postoperative cavities, which is sufficiently fast to be applied to large‐group studies including Quantitative Susceptibility Mapping and functional MRI (with phase‐based distortion correction). METHODS: The proposed path‐following phase‐unwrapping algorithm, ROMEO, estimates the coherence of the signal both in space—using MRI magnitude and phase information—and over time, assuming approximately linear temporal phase evolution. This information is combined to form a quality map that guides the unwrapping along a 3D path through the object using a computationally efficient minimum spanning tree algorithm. ROMEO was tested against the two most commonly used exact phase‐unwrapping methods, PRELUDE and BEST PATH, in simulated topographies and at several field strengths: in 3T and 7T in vivo human head images and 9.4T ex vivo rat head images. RESULTS: ROMEO was more reliable than PRELUDE and BEST PATH, yielding unwrapping results with excellent temporal stability for multi‐echo or multi‐time‐point data. It does not require image masking and delivers results within seconds, even in large, highly wrapped multi‐echo data sets (eg, 9 seconds for a 7T head data set with 31 echoes and a 208 × 208 × 96 matrix size). CONCLUSION: Overall, ROMEO was both faster and more accurate than PRELUDE and BEST PATH, delivering exact results within seconds, which is well below typical image acquisition times, enabling potential on‐console application.
format Online
Article
Text
id pubmed-7821134
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher John Wiley and Sons Inc.
record_format MEDLINE/PubMed
spelling pubmed-78211342021-01-26 Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO) Dymerska, Barbara Eckstein, Korbinian Bachrata, Beata Siow, Bernard Trattnig, Siegfried Shmueli, Karin Robinson, Simon Daniel Magn Reson Med Full Papers—Computer Processing and Modeling PURPOSE: To develop a rapid and accurate MRI phase‐unwrapping technique for challenging phase topographies encountered at high magnetic fields, around metal implants, or postoperative cavities, which is sufficiently fast to be applied to large‐group studies including Quantitative Susceptibility Mapping and functional MRI (with phase‐based distortion correction). METHODS: The proposed path‐following phase‐unwrapping algorithm, ROMEO, estimates the coherence of the signal both in space—using MRI magnitude and phase information—and over time, assuming approximately linear temporal phase evolution. This information is combined to form a quality map that guides the unwrapping along a 3D path through the object using a computationally efficient minimum spanning tree algorithm. ROMEO was tested against the two most commonly used exact phase‐unwrapping methods, PRELUDE and BEST PATH, in simulated topographies and at several field strengths: in 3T and 7T in vivo human head images and 9.4T ex vivo rat head images. RESULTS: ROMEO was more reliable than PRELUDE and BEST PATH, yielding unwrapping results with excellent temporal stability for multi‐echo or multi‐time‐point data. It does not require image masking and delivers results within seconds, even in large, highly wrapped multi‐echo data sets (eg, 9 seconds for a 7T head data set with 31 echoes and a 208 × 208 × 96 matrix size). CONCLUSION: Overall, ROMEO was both faster and more accurate than PRELUDE and BEST PATH, delivering exact results within seconds, which is well below typical image acquisition times, enabling potential on‐console application. John Wiley and Sons Inc. 2020-10-26 2021-04 /pmc/articles/PMC7821134/ /pubmed/33104278 http://dx.doi.org/10.1002/mrm.28563 Text en © 2020 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine This is an open access article under the terms of the http://creativecommons.org/licenses/by/4.0/ License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
spellingShingle Full Papers—Computer Processing and Modeling
Dymerska, Barbara
Eckstein, Korbinian
Bachrata, Beata
Siow, Bernard
Trattnig, Siegfried
Shmueli, Karin
Robinson, Simon Daniel
Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title_full Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title_fullStr Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title_full_unstemmed Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title_short Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
title_sort phase unwrapping with a rapid opensource minimum spanning tree algorithm (romeo)
topic Full Papers—Computer Processing and Modeling
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7821134/
https://www.ncbi.nlm.nih.gov/pubmed/33104278
http://dx.doi.org/10.1002/mrm.28563
work_keys_str_mv AT dymerskabarbara phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT ecksteinkorbinian phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT bachratabeata phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT siowbernard phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT trattnigsiegfried phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT shmuelikarin phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo
AT robinsonsimondaniel phaseunwrappingwitharapidopensourceminimumspanningtreealgorithmromeo