期刊
MAGNETIC RESONANCE IN MEDICINE
卷 73, 期 3, 页码 1289-1299出版社
WILEY
DOI: 10.1002/mrm.25193
关键词
fat water decomposition; noniterative; graph cut; optimal surface; minimum-cost closed set
资金
- NSF [CCF-0844812, CCF-1116067]
- ACS [RSG-11-267-01-CCE]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0844765] Funding Source: National Science Foundation
PurposeThis article focuses on developing a novel noniterative fat water decomposition algorithm more robust to fat water swaps and related ambiguities. MethodsField map estimation is reformulated as a constrained surface estimation problem to exploit the spatial smoothness of the field, thus minimizing the ambiguities in the recovery. Specifically, the differences in the field map-induced frequency shift between adjacent voxels are constrained to be in a finite range. The discretization of the above problem yields a graph optimization scheme, where each node of the graph is only connected with few other nodes. Thanks to the low graph connectivity, the problem is solved efficiently using a noniterative graph cut algorithm. The global minimum of the constrained optimization problem is guaranteed. The performance of the algorithm is compared with that of state-of-the-art schemes. Quantitative comparisons are also made against reference data. ResultsThe proposed algorithm is observed to yield more robust fat water estimates with fewer fat water swaps and better quantitative results than other state-of-the-art algorithms in a range of challenging applications. ConclusionThe proposed algorithm is capable of considerably reducing the swaps in challenging fat water decomposition problems. The experiments demonstrate the benefit of using explicit smoothness constraints in field map estimation and solving the problem using a globally convergent graph-cut optimization algorithm. Magn Reson Med 73:1289-1299, 2015. (c) 2014 Wiley Periodicals, Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据