1996
DOI: 10.1016/s0165-1684(96)00131-4
|View full text |Cite
|
Sign up to set email alerts
|

MRI scan time reduction through non-uniform sampling and SVD-based estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2003
2003
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…First partial acquisition (1, 5, 9), second partial acquisition (2, 6, 10), third partial acquisition (3, 7, 11), and compound volume (4, 8, 12). The bottom row (13–16) shows the geometry of the corresponding partial and compound k ‐spaces. The circles help locate the stenosis.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…First partial acquisition (1, 5, 9), second partial acquisition (2, 6, 10), third partial acquisition (3, 7, 11), and compound volume (4, 8, 12). The bottom row (13–16) shows the geometry of the corresponding partial and compound k ‐spaces. The circles help locate the stenosis.…”
Section: Resultsmentioning
confidence: 99%
“…Interleaved spiral acquisitions, which allow a more efficient exploitation of the slew rate of gradient amplifiers, and reduce sensitivity to the magnetic field inhomogeneities, remain the most common choice in cardiac ultrafast imaging. However, these methods call for sophisticated reconstruction techniques, including resampling (5, 11, 12), gridding (13–15), and least‐squares‐based interpolation (16–18). Simultaneous acquisition of spatial harmonics (SMASH) (19, 20) and sensitivity encoding (SENSE) (21, 22) methods have recently been shown to further reduce acquisition time by providing a parallel acquisition of MR data using phased‐array antennas.…”
mentioning
confidence: 99%
“…While the optimization problems that result from the use of these functionals are nonconvex and NP-hard to solve in general [22], there exist fast greedy algorithms for addressing problems involving these functionals that perform very well in practice and can easily incorporate additional constraints. Examples include incremented rank PowerFactorization (IRPF) [54] (which can have theoretical performance guarantees [55], and has been previously used in MRI [2], [25], [26], [29], [39]), and variations on the Cadzow algorithm [56] (also previously used in MRI [4], [37], [46], [47]).…”
Section: Problem Formulation and Algorithmmentioning
confidence: 99%
“…We are aware of only two other low-rank image reconstruction methods that have been proposed for calibrationless low-rank reconstruction of individual MRI images [47], [48], and neither of these approaches were designed to impose phase or support constraints. Specifically, [47] is based on generic ARMA modeling assumptions [6]–[9], while [48] is related to feature-recognizing MRI [10], [11], and uses the assumptions of singular value decomposition (SVD) image coding [49].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation