2016
DOI: 10.1007/978-3-319-45886-1_12
|View full text |Cite
|
Sign up to set email alerts
|

Randomly Sparsified Synthesis for Model-Based Deformation Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…Since this full synthesis is very expensive computationally, we simplify the scanning process to a blur, implemented by a convolution with the point spread functions (PSF) of the system. To simplify the synthesis further, we make use of sparse synthesis [14,23] where not the whole image is synthesized, but only a sparse subset of it. Here, the result of the sparse synthesis is a set of one dimensional profiles orthogonal to the cortical surface, equivalent to a sparse sampling of a full synthesis 1 .…”
Section: Introductionmentioning
confidence: 99%
“…Since this full synthesis is very expensive computationally, we simplify the scanning process to a blur, implemented by a convolution with the point spread functions (PSF) of the system. To simplify the synthesis further, we make use of sparse synthesis [14,23] where not the whole image is synthesized, but only a sparse subset of it. Here, the result of the sparse synthesis is a set of one dimensional profiles orthogonal to the cortical surface, equivalent to a sparse sampling of a full synthesis 1 .…”
Section: Introductionmentioning
confidence: 99%