2012
DOI: 10.1007/978-3-642-33564-8_4
|View full text |Cite
|
Sign up to set email alerts
|

Euler’s Approximations to Image Reconstruction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
2
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…The two parameters, dt and p, can be viewed as a single dt with a small value for the classical Euler scheme. In Figure 5, from [7], we can observe that implementing the modified Euler scheme resulted in a remarkable 30fold acceleration in the reconstruction process! The introduction of this scheme played a pivotal role in the further development of denoising methods based on backward stochastic differential equations.…”
Section: Approximation Parametersmentioning
confidence: 98%
See 2 more Smart Citations
“…The two parameters, dt and p, can be viewed as a single dt with a small value for the classical Euler scheme. In Figure 5, from [7], we can observe that implementing the modified Euler scheme resulted in a remarkable 30fold acceleration in the reconstruction process! The introduction of this scheme played a pivotal role in the further development of denoising methods based on backward stochastic differential equations.…”
Section: Approximation Parametersmentioning
confidence: 98%
“…are the maximum and the minimum of F x while the orthogonal eigenvectors θ + (u, x) and θ − (u, x) are Algorithm 1: Pseudo-code for Example 2. input : u 0 -noisy image, σ -standard deviation of the noise N , j, m, dt, p -approximation parameters (a k ) k=0,1...,m−1 -coefficients defined by formulas ( 5), ( 6), (7) output: u -reconstructed image foreach pixel position x do…”
Section: Generalization To Color Spaces Rgb Spacementioning
confidence: 99%
See 1 more Smart Citation
“…After these remarks the request is the following: to fast implementation we need fast counting of the value X x tj (ω). In order to get X x tj (ω) we use the following modification of Euler's approximation taken from [5]:…”
Section: 2mentioning
confidence: 99%
“…At locations where gradient is large in all directions it is possible that condition Θ does not hold as many times as we would expect. To avoid this we propose the following modification [6]:…”
Section: Modified Diffusion With Random Terminal Timementioning
confidence: 99%