KEYWORDS: Image quality, Magnetic resonance imaging, Visualization, Magnetism, Medicine, Data acquisition, Image analysis, Digital filtering, Visual process modeling, Data modeling
Parallel magnetic resonance imaging through sensitivity encoding using multiple receiver coils has emerged as an effective tool to reduce imaging time or improve the image quality. Reconstructed image quality is limited by the noise in the acquired k-space data, inaccurate estimation of the sensitivity map, and the ill-conditioned nature of the coefficient matrix. Tikhonov Regularization is currently the most popular method to solve the ill-condition problem. Selections of the regularization map and the regularization parameter are very important. The Perceptual Difference Model (PDM) is a quantitative image quality evaluation tool which has been successfully applied to varieties of MR applications. High correlation between the human rating and the PDM score shows that PDM could be suitable for evaluating image quality in parallel MR imaging. By applying PDM, we compared four methods of selecting the regularization map and four methods of selecting regularization parameter. We find that generalized series (GS) method to select the regularization map together with spatially adaptive method to select the regularization parameter gives the best solution to reconstruct the image. PDM also work as a quantitative image quality index to optimize two important free parameters in spatially adaptive method. We conclude that PDM is an effective tool in helping design and optimize reconstruction methods in parallel MR imaging.
We propose a new subspace decomposition scheme called anisotropic wavelet packets which broadens the existing definition of 2-D wavelet packets. By allowing arbitrary order of row and column decompositions, this scheme fully considers the adaptivity, which helps find the best bases to represent an image. We also show that the number of candidate tree structures in the anisotropic case is much larger than isotropic case. The greedy algorithm and double-tree algorithm are then presented and experimental results are shown.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.