2013 IEEE 10th International Symposium on Biomedical Imaging 2013
DOI: 10.1109/isbi.2013.6556685
|View full text |Cite
|
Sign up to set email alerts
|

Globally convergent 3D dynamic PET reconstruction with patch-based non-convex low rank regularization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Here, a low rank constraint is originated from the matrix completion problem in compressed sensing [4]. Specifically, in this paper, a non-convex low rank regularization is exploited [5]. To deal with this issue, the concave-convex procedure (CCCP) [6] is used to convexify the concave rank prior.…”
Section: Introductionmentioning
confidence: 99%
“…Here, a low rank constraint is originated from the matrix completion problem in compressed sensing [4]. Specifically, in this paper, a non-convex low rank regularization is exploited [5]. To deal with this issue, the concave-convex procedure (CCCP) [6] is used to convexify the concave rank prior.…”
Section: Introductionmentioning
confidence: 99%
“…of Bio and Brain Engineering, KAIST, 291 Daehak-ro, Yuseong-gu, Daejon 305-701, Republic of Korea the matrix completion problem in compressed sensing [4]. Specifically, a non-convex low rank regularization has been exploited [5]. To deal with this issue, the concave-convex procedure (CCCP) [6] is used to convexify the concave rank prior.…”
Section: Introductionmentioning
confidence: 99%