1996
DOI: 10.1364/josaa.13.000464
|View full text |Cite
|
Sign up to set email alerts
|

Scanning singular-value-decomposition method for restoration of images with space-variant blur

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(26 citation statements)
references
References 11 publications
0
26
0
Order By: Relevance
“…Regularization methods are generally used to control the increase of noise in the reconstructed source found by the semilinear method (Suyu et al 2006). Several optimization methods have been applied to problems with spatially variant blur including Landweber iteration (Nocedal & Wright (1999);Fish et al (1996);Trussel & Hunt (1978)), Richardson-Lucy deconvolution (Faisal et al 1995), and Lanczos-Tikhonov hybrid methods (Chung et al 2008) in the context of the standard image deconvolution problem. Following Rogers & Fiege (2011), we focus on the conjugate gradient method for least-squares problems (CGLS) and the steepest descent method (SD).…”
Section: A Small-scale Testmentioning
confidence: 99%
“…Regularization methods are generally used to control the increase of noise in the reconstructed source found by the semilinear method (Suyu et al 2006). Several optimization methods have been applied to problems with spatially variant blur including Landweber iteration (Nocedal & Wright (1999);Fish et al (1996);Trussel & Hunt (1978)), Richardson-Lucy deconvolution (Faisal et al 1995), and Lanczos-Tikhonov hybrid methods (Chung et al 2008) in the context of the standard image deconvolution problem. Following Rogers & Fiege (2011), we focus on the conjugate gradient method for least-squares problems (CGLS) and the steepest descent method (SD).…”
Section: A Small-scale Testmentioning
confidence: 99%
“…This approach does not satisfy us because the coordinate transformation functions need to be known explicitly. Another approach considered, for example, in (Fish et al, 1996), is based on the assumption that the blurring is approximately spatially invariant in small regions of the image domain. Each region is restored using its own spatially invariant PSF, and the results are then sewn together to obtain the restored image.…”
Section: Validation Of Linear Spatially Variant Blurring Modelmentioning
confidence: 99%
“…Fortunately the matrix K can usually be represented by a compact data structure, such as when the blur is spatially invariant. Approximation techniques for more complicated spatially variant blurs include geometrical coordinate transformations [62,83,87], sectioning [37,97,98], PSF interpolation [14,33,67,68], and in some cases a sparse matrix data structure can be used for K [32,80].…”
Section: Introductionmentioning
confidence: 99%