Name
Abstract | ||
|---|---|---|
In many settings, multiple Magnetic Resonance Imaging (MRI) scans are performed with different contrast characteristics at a single patient visit. Unfortunately, MRI data-acquisition is inherently slow creating a persistent need to accelerate scans. Multi-contrast reconstruction deals with the joint reconstruction of different contrasts simultaneously. Previous approaches suggest solving a regularized optimization problem using group sparsity and/or color total variation, using composite-splitting denoising and FISTA. Yet, there is significant room for improvement in existing methods regarding computation time, ease of parameter selection, and robustness in reconstructed image quality. Selection of sparsifying transformations is critical in applications of compressed sensing. Here we propose using non-convex p-norm group sparsity (with p < 1), and apply color total variation (CTV). Our method is readily applicable to magnitude images rather than each of the real and imaginary parts separately. We use the constrained form of the problem, which allows an easier choice of data-fidelity error-bound (based on noise power determined from a noise-only scan without any RF excitation). We solve the problem using an adaptation of Alternating Direction Method of Multipliers (ADMM), which provides faster convergence in terms of CPU-time. We demonstrated the effectiveness of the method on two MR image sets (numerical brain phantom images and SRI24 atlas data) in terms of CPU-time and image quality. We show that a non-convex group sparsity function that uses the p-norm instead of the convex counterpart accelerates convergence and improves the peak-Signal-to-Noise-Ratio (pSNR), especially for highly undersampled data. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1117/12.2252101 | Proceedings of SPIE |
Field | DocType | Volume |
Convergence (routing),Noise reduction,Computer vision,Noise power,Computer science,Imaging phantom,Image quality,Robustness (computer science),Artificial intelligence,Optimization problem,Compressed sensing | Conference | 10133 |
ISSN | Citations | PageRank |
0277-786X | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alper Güngör | 1 | 5 | 4.50 |
| Emre Kopanoglu | 2 | 0 | 0.68 |
| Tolga Çukur | 3 | 36 | 8.84 |
| H. Emre Guven | 4 | 4 | 4.48 |