Skip to main content
. Author manuscript; available in PMC: 2015 Apr 28.
Published in final edited form as: Magn Reson Med. 2014 Mar 6;73(3):1289–1299. doi: 10.1002/mrm.25193

Algorithm.

Graph surface search for optimal field map ( Inline graphic(x, y, f))

  1. Construct 3D graph G(x, y, f) and assign costs Inline graphic(x, y, f) to each node

  2. Transform the surface estimation problem to closed set estimation: G → G′

    1. Transform cost at each node to Inline graphic(x, y, f) using [9]

    2. Build intra- and inter-column edges

  3. Solve for the optimal closed set using minimum s-t cut algorithm

  4. Recover the optimal surface S* and refine the solution