G.S. Sobering#+, Y. Shiferaw*, P. van Gelderen*, C.T.W. Moonen*Quantitative Measurement of the Phase Error for a Simple and Rapid Phase-Unwrapping Algorithm
Poster at 1995 SMR Annual Meeting
When computing phase maps from complex-valued MR
images, the range of phase angles often exceeds ±2
radians
across the image. This causes artifactual discontinuities (so-
called "wraps") in the image where the phase angle jumps
from +
to -
, or -
to +
. A powerful and simple method
for calculating the relative phase between any two points in a
complex-valued array (image or 3D volume) is to sum the
incremental angular differences between neighboring voxels
along a path connecting the two points [1]. The
"unwrapping" problem is thus reduced to selecting an
algorithm that connects all the voxels in the object to a single
reference voxel.
In the ideal case, the phase determined by this unwrapping procedure is path independent. However, in real data, noise and regions of low signal can cause incorrect results. Many algorithms have been developed to address this problem [2-5]. The computational requirements of some of these algorithms are quite steep, especially for 3D data-sets.
In this abstract, we describe the analysis of phase maps generated using a variety of simple path algorithms. These maps demonstrate the insensitivity of this technique to the choice of path selection algorithm for typical MR data. This implies that simple (and rapid) path creation algorithms, using image magnitude to identify "bad" voxels, may be used successfully. Here, one such algorithm is described and evaluated in detail.
This method of calculating
Ø/
l
has the advantage that it
directly evaluates the difference phase angle between the two
locations, even if they happen to be on either side of ±
phase-wrap. This means that phase-wraps present in the
original image do not affect the
Ø/
l
values, unlike the
direct method:
Two path algorithms were used to generate maps for this analysis. The first is a very simple rectilinear algorithm, which is presented not as a practical method, but to demonstrate the insensitivity of this class of techniques to non-optimal path choice. In this algorithm, the paths follow the imaging grid axes. For example, in a 2D image, one path between (15,10) and (20,25) would move from (15,10) across to (20,10), and then up to (20,25). For 2D images there are two possible paths (denoted: xy and yx) between any two points, and for 3D volumes there are six (xyz, yzx, zxy, yxz, xzy, zyx). In practice, this algorithm has many disadvantages. Most troubling is that many objects cannot be fully unwrapped, because all the rectilinear paths connecting some points inside the object traverse the exterior region. The second path algorithm is more optimal and robust. It is based on a standard seeded region growing algorithm. The algorithm is started with a single-voxel region at the reference point. At every iteration:
Ø/
l
map. The neighbor voxels are marked as visited, and
added to the list of boundry voxels for the next
iteration.
Phantom Brain
-------------- --------------
s 4.8e-8 radians 3.2e-7 radians
max. 3.6e-7 radians 1.9e-6 radians