31.12.2014 Views

Efficient MR image reconstruction for compressed MR imaging

Efficient MR image reconstruction for compressed MR imaging

Efficient MR image reconstruction for compressed MR imaging

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

J. Huang et al. / Medical Image Analysis 15 (2011) 670–679 675<br />

SNR<br />

SNR<br />

20<br />

18<br />

16<br />

14<br />

12<br />

10<br />

8<br />

CG<br />

TVC<strong>MR</strong>I<br />

RecPF<br />

CSA<br />

FCSA<br />

6<br />

0 0.5 1 1.5 2 2.5 3 3.5<br />

CPU Time (s)<br />

18<br />

16<br />

14<br />

12<br />

10<br />

8<br />

(a)<br />

CG<br />

TVC<strong>MR</strong>I<br />

RecPF<br />

CSA<br />

FCSA<br />

6<br />

0 0.5 1 1.5 2 2.5 3 3.5<br />

CPU Time (s)<br />

(c)<br />

SNR<br />

SNR<br />

16<br />

14<br />

12<br />

10<br />

CG<br />

8<br />

TVC<strong>MR</strong>I<br />

RecPF<br />

6<br />

CSA<br />

FCSA<br />

4<br />

0 0.5 1 1.5 2 2.5 3 3.5<br />

CPU Time (s)<br />

(b)<br />

24<br />

22<br />

20<br />

18<br />

16<br />

14<br />

12<br />

CG<br />

TVC<strong>MR</strong>I<br />

10<br />

RecPF<br />

8<br />

CSA<br />

FCSA<br />

6<br />

0 0.5 1 1.5 2 2.5 3 3.5<br />

CPU Time (s)<br />

(d)<br />

Fig. 6. Per<strong>for</strong>mance comparisons (CPU-Time vs. SNR) on different <strong>MR</strong> <strong>image</strong>s: (a) cardiac <strong>image</strong>; (b) brain <strong>image</strong>; (c) chest <strong>image</strong> and (d) artery <strong>image</strong>.<br />

Table 1<br />

Comparisons of the SNR (db) over 100 runs.<br />

CG TVC<strong>MR</strong>I RecPF CSA FCSA<br />

Cardiac 12.43 ± 1.53 17.54 ± 0.94 17.79 ± 2.33 18.41 ± 0.73 19.26 ± 0.78<br />

Brain 10.33 ± 1.63 14.11 ± 0.34 14.39 ± 2.17 15.25 ± 0.23 15.86 ± 0.22<br />

Chest 12.83 ± 2.05 16.97 ± 0.32 17.03 ± 2.36 17.10 ± 0.31 17.58 ± 0.32<br />

Artery 13.74 ± 2.28 18.39 ± 0.47 19.30 ± 2.55 22.03 ± 0.18 23.50 ± 0.20<br />

Table 2<br />

Comparisons of the CPU Time (s) over 100 runs.<br />

CG TVC<strong>MR</strong>I RecPF CSA FCSA<br />

Cardiac 2.82 ± 0.16 3.16 ± 0.10 2.97 ± 0.12 2.27 ± 0.08 2.30 ± 0.08<br />

Brain 2.81 ± 0.15 3.12 ± 0.15 2.95 ± 0.10 2.27 ± 0.12 2.31 ± 0.13<br />

Chest 2.79 ± 0.16 3.00 ± 0.11 2.89 ± 0.07 2.21 ± 0.06 2.26 ± 0.07<br />

Artery 2.81 ± 0.17 3.04 ± 0.13 2.94 ± 0.09 2.22 ± 0.07 2.27 ± 0.13<br />

computed with cost Oðp logðpÞÞ. In the step x k = project(x k ,[l,u]), the<br />

function x = project(x,[l,u]) is defined as: (1) x = x if l 6 x 6 u; (2)<br />

x = l if x < u; and (3) x = u if x > u, where [l,u] is the range of x. For<br />

example, in the case of <strong>MR</strong> <strong>image</strong> <strong>reconstruction</strong>, we can let l =0<br />

and u = 255 <strong>for</strong> 8-bit gray <strong>MR</strong> <strong>image</strong>s. This step costs OðpÞ. Thus,<br />

the total cost of each iteration in the FCSA is Oðp logðpÞÞ.<br />

With these two key features, the FCSA efficiently solves the <strong>MR</strong><br />

<strong>image</strong> <strong>reconstruction</strong> problem (1) and obtains better <strong>reconstruction</strong><br />

results in terms of both the <strong>reconstruction</strong> accuracy and computation<br />

complexity. The experimental results in the next section<br />

demonstrate its superior per<strong>for</strong>mance compared with all previous<br />

methods <strong>for</strong> <strong>compressed</strong> <strong>MR</strong> <strong>image</strong> <strong>reconstruction</strong>.<br />

Algorithm 4. CSA<br />

Input: q =1/L, a, b, t 1 =1x 0 = r 1<br />

<strong>for</strong> k =1to K do<br />

x g = r k qrf(r k )<br />

x 1 = prox q (2akxk TV )(x g )<br />

x 2 = prox q (2bkUxk 1 )(x g )<br />

x k = (x 1 + x 2 )/2<br />

x k =project (x k ,[l,u])<br />

r k+1 = x k<br />

end<strong>for</strong><br />

Algorithm 5. FCSA<br />

Input: q =1/L, a, b, t 1 =1x 0 = r 1<br />

<strong>for</strong> k =1to K do<br />

x g = r k qrf(r k )<br />

x 1 = prox q (2akxk TV )(x g )<br />

x 2 = prox q (2bkUxk 1 )(x g )<br />

x k = (x 1 + x 2 )/2;<br />

x k =project (x k ,[l,u])<br />

qffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi<br />

t kþ1 ¼ð1 þ 1 þ 4ðt k Þ 2 Þ=2<br />

r k+1 = x k + ((t k 1)/t k+1 )(x k x k 1 )<br />

end <strong>for</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!