Parallel computing of patch-based nonlocal operator and its application in compressed sensing MRI

2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Magnetic resonance imaging has been benefited from compressed sensing in improving imaging speed. But the computation time of compressed sensing magnetic resonance imaging (CS-MRI) is relatively long due to its iterative reconstruction process. Recently, a patch-based nonlocal operator (PANO) has been applied in CS-MRI to significantly reduce the reconstruction error by making use of self-similarity in images. But the two major steps in PANO, learning similarities and performing 3D wavelet transform, require extensive computations. In this paper, a parallel architecture based on multicore processors is proposed to accelerate computations of PANO. Simulation results demonstrate that the acceleration factor approaches the number of CPU cores and overall PANO-based CS-MRI reconstruction can be accomplished in several seconds. © 2014 Qiyue Li et al.

Cite

CITATION STYLE

APA

Li, Q., Qu, X., Liu, Y., Guo, D., Ye, J., Zhan, Z., & Chen, Z. (2014). Parallel computing of patch-based nonlocal operator and its application in compressed sensing MRI. Computational and Mathematical Methods in Medicine, 2014. https://doi.org/10.1155/2014/257435

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free