2013 IEEE Conference on Computer Vision and Pattern Recognition 2013
DOI: 10.1109/cvpr.2013.139
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Deconvolution

Abstract: We present a novel stochastic framework for non-blind deconvolution based on point samples obtained from random walks. Unlike previous methods that must be tailored to specific regularization strategies, the new Stochastic Deconvolution method allows arbitrary priors, including nonconvex and data-dependent regularizers, to be introduced and tested with little effort. Stochastic Deconvolution is straightforward to implement, produces state-of-the-art results and directly leads to a natural boundary condition fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 11 publications
(19 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…In earlier work, we presented stochastic random-walk optimization for tomography [38] and non-blind deblurring [3] that uses many incremental local solution updates at sampled locations. Sample placement is driven by a stochastic random walk that favors local exploration where fast progress has recently been made.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…In earlier work, we presented stochastic random-walk optimization for tomography [38] and non-blind deblurring [3] that uses many incremental local solution updates at sampled locations. Sample placement is driven by a stochastic random walk that favors local exploration where fast progress has recently been made.…”
Section: Related Workmentioning
confidence: 99%
“…Given the kernel estimated at the current scaleK s , the function updateIntrinsicImage() in Algorithm 1 updates our estimate of the intrinsic image by solving a non-blind deconvolution problem using a stochastic random walk optimization (Algorithm 2, also see [3]), which minimizes objectives of the form: …”
Section: A Updating the Intrinsic Imageî Smentioning
confidence: 99%
See 2 more Smart Citations
“…Hence, numerous deconvolution algorithms have been developed to estimate the latent sharp image. They include Wiener [2] and Richardson-Lucy (RL) [3,4] techniques, least squares minimization [5], Bayesian inference [6][7][8], advanced variational based [9][10][11][12][13], and stochastic framework [14] methods. A challenging problem in latent image restoration is the presence of wavelike artifacts called ringing that appear near strong edges.…”
Section: (C) Blur Kernel (Psf) (D)-(g)mentioning
confidence: 99%