2016
DOI: 10.1002/mrm.26174
|View full text |Cite
|
Sign up to set email alerts
|

Phase unwrapping with graph cuts optimization and dual decomposition acceleration for 3D high‐resolution MRI data

Abstract: Dual decomposition significantly improves the computational efficiency of 3D graph cut-based phase unwrapping algorithms. Magn Reson Med 77:1353-1358, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 31 publications
(28 citation statements)
references
References 19 publications
(51 reference statements)
0
28
0
Order By: Relevance
“…Further improvement will be considered to tackle this issue, such as by incorporating global minimization. 18,26 Another limitation of the current implementation of SPUN is that it simply unwraps a voxel by reducing its absolute phase difference with the seed voxel to be less than π. Although efficient and generally competent, it will fail in certain scenarios such as phase poles 27 or the so-called CUSP artifacts due to suboptimal multichannel combination.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Further improvement will be considered to tackle this issue, such as by incorporating global minimization. 18,26 Another limitation of the current implementation of SPUN is that it simply unwraps a voxel by reducing its absolute phase difference with the seed voxel to be less than π. Although efficient and generally competent, it will fail in certain scenarios such as phase poles 27 or the so-called CUSP artifacts due to suboptimal multichannel combination.…”
Section: Discussionmentioning
confidence: 99%
“…14,15 Global optimization methods remove phase aliasing by proposing models for the true phase map and performing optimization calculations. However, optimization performance depends on the specific model [16][17][18] or weighting function, 19 and may not provide a general solution over different scenarios.…”
mentioning
confidence: 99%
“…For the third algorithm, a Laplacian unwrapping algorithm from the morphology enabled dipole inversion (MEDI) QSM toolbox was used and modified in‐house to resemble the algorithm introduced by Schofield et al (L‐Schofield‐Rounding). Additionally, a quality‐guided region‐growing method as proposed by Cusack et al (QG‐Cusack) and a graph‐cuts algorithm described by Dong et al (GC‐Dong) were selected from the MEDI toolbox as well. The last algorithm is a quality‐guided region‐growing approach, developed by Fortier and Levesque, showing promising results for regions with high‐susceptibility jumps in their whole‐head phantom (QG‐Fortier).…”
Section: Methodsmentioning
confidence: 99%
“…Energy minimization problem, solved by jump-move optimization 24 Quality-Guided Region Growing-Cusack (QG-Cusack)…”
Section: Laplacianmentioning
confidence: 99%
“…The phase calculated from the complex MR data is generally wrapped into the range of (Àp, p], and phase unwrapping is usually required to recover the underlying true phase. A large number of phaseunwrapping algorithms have been proposed (2,(10)(11)(12)(13)(14). Phase-unwrapping methods are generally based on the assumption that the underlying true phase is smooth and the phase difference between adjacent pixels is less than p. If this assumption is satisfied, then the true phase map can be easily obtained (10).…”
Section: Introductionmentioning
confidence: 99%