2015
DOI: 10.1007/978-3-319-22482-4_60
|View full text |Cite
|
Sign up to set email alerts
|

Acceleration of Perfusion MRI Using Locally Low-Rank Plus Sparse Model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Now, return back to Equation (10). Suppose that z ∈ Γ; then, (Lz) ∈ [b 1 , b 2 ]; from Equation 11, we have proj [b 1 ,b 2 ] (Lz) = Lz; and, from Equation 10, we get proj Γ (z) = z, which is correct.…”
Section: Definitionmentioning
confidence: 90%
See 1 more Smart Citation
“…Now, return back to Equation (10). Suppose that z ∈ Γ; then, (Lz) ∈ [b 1 , b 2 ]; from Equation 11, we have proj [b 1 ,b 2 ] (Lz) = Lz; and, from Equation 10, we get proj Γ (z) = z, which is correct.…”
Section: Definitionmentioning
confidence: 90%
“…Proximal algorithms are a modern branch of mathematical optimization, whose principal building blocks are the so-called proximal operators [1][2][3][4]. In applications, the model of the problem often involves the composition of a non-linear function with a linear operator [5][6][7][8][9][10]. When proximal optimization is utilized to find approximate solution iteratively, the proximal operator of such a composition is needed, making the resulting algorithms computationally expensive in general [11].…”
Section: Introductionmentioning
confidence: 99%
“…Recently, Hankel or block‐Hankel matrix completion has been used for recovering undersampled spectral data and calibrationless parallel imaging reconstruction . The low‐rank property of dynamic MRI data has also been demonstrated and utilized in accelerated reconstructions .…”
Section: Introductionmentioning
confidence: 99%