By Topic

Partially parallel MR image reconstruction using sensitivity encoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yashtini, M. ; Dept. of Math., Univ. of Florida, Gainesville, FL, USA ; Hager, W.W. ; Yunmei Chen ; Xiaojing Ye

A new algorithm is presented for efficiently solving image reconstruction problems that arise in partially parallel magnetic resonance imaging. This algorithm minimizes an objective function of the form φ(Bu) + 1/2||FpSu - f||2, where φ is the regularization term which may be nonsmooth. In image reconstruction, the φ term corresponds to total variation smoothing and/or L1 regularization term. The least square term 1/2||FpSu - f||2 is the fidelity term. In our application, f represents undersampled data from a partially parallel imaging (PPI) system. The proposed algorithm is a generalization of the Bregman operator splitting algorithm with variable stepsize (BOSVS) in which the previous Barzilai-Borwein (BB) step is replaced by a cyclic BB (CBB) step, and an L1 term Ψ is added to the energy function. Experimental results on clinical partially parallel imaging data are given.

Published in:

Image Processing (ICIP), 2012 19th IEEE International Conference on

Date of Conference:

Sept. 30 2012-Oct. 3 2012