2013
DOI: 10.1002/jmri.24365
|View full text |Cite
|
Sign up to set email alerts
|

Fast image reconstruction with L2‐regularization

Abstract: Purpose We introduce L2-regularized reconstruction algorithms with closed-form solutions that achieve dramatic computational speed-up relative to state of the art L1- and L2-based iterative algorithms while maintaining similar image quality for various applications in MRI reconstruction. Materials and Methods We compare fast L2-based methods to state of the art algorithms employing iterative L1- and L2-regularization in numerical phantom and in vivo data in three applications; 1) Fast Quantitative Susceptibi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
158
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 148 publications
(164 citation statements)
references
References 31 publications
0
158
0
Order By: Relevance
“…The modulated closed form method has reconstruction errors smaller than those obtained both with similar direct methods proposed by other groups (Bilgic et al, 2013;Schweser et al, 2013). Not surprisingly, the optimum results (and independence on the regularization parameters) are found when the regularization is limited to a region tightly positioned around the magic angle cones (nthr = 0.1-0.2) as done in other k-space modulated iterative methods Wu et al, 2012).…”
Section: Numerical Simulation Phantommentioning
confidence: 53%
See 2 more Smart Citations
“…The modulated closed form method has reconstruction errors smaller than those obtained both with similar direct methods proposed by other groups (Bilgic et al, 2013;Schweser et al, 2013). Not surprisingly, the optimum results (and independence on the regularization parameters) are found when the regularization is limited to a region tightly positioned around the magic angle cones (nthr = 0.1-0.2) as done in other k-space modulated iterative methods Wu et al, 2012).…”
Section: Numerical Simulation Phantommentioning
confidence: 53%
“…The prior information is extracted from the phase and magnitude maps assuming them to have similar edges of the underlying brain structure or simply assuming that natural images are sparse in some basis set. Recently, it was noted that this could be performed as a direct inversion when assuming smoothness of the susceptibility map (Bilgic et al, 2013) (see Modulated closed form solution).…”
Section: Contents Lists Available At Sciencedirectmentioning
confidence: 99%
See 1 more Smart Citation
“…23 Similar to the iterative QSM, the deterministic QSM involves minimization of the following equation:…”
Section: Deterministic Qsmmentioning
confidence: 99%
“…Both, increased spatial resolution and spectral bandwidth, lead to increased demands on gradient systems and ultimately lower signal‐to‐noise ratio (SNR) efficiency 16, 17. Parallel imaging, on the other hand, becomes more efficient at higher B 0 , but achievable accelerations are lower than for SSE ( 10) 15 and lipid contamination is aggravated, which calls for additional lipid suppression techniques 2, 18, 19. While established SSE trajectories (i.e., EPSI, spirals) can be certainly optimized for higher B 0 , the increased gradient demands at 7T due to the increased spectral bandwidth make these trajectories inefficient for high spatial resolutions.…”
Section: Introductionmentioning
confidence: 99%