2010
DOI: 10.1007/s10898-009-9516-x
|View full text |Cite
|
Sign up to set email alerts
|

Iterative regularization algorithms for constrained image deblurring on graphics processors

Abstract: Image deblurring, Scaled gradient projection method, Graphics processing units,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
8
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 26 publications
2
8
0
Order By: Relevance
“…We remark that in these examples the same results are obtained by means of the discrepancy function (15). Since SGP has been already implemented on graphics processors (GPU) [29], implementing the discrepancy stopping rule might provide a very fast tool for image deblurring with automatic stopping of iterations. Potential applications are open to image deblurring in astronomy and microscopy.…”
Section: Deblurringsupporting
confidence: 60%
“…We remark that in these examples the same results are obtained by means of the discrepancy function (15). Since SGP has been already implemented on graphics processors (GPU) [29], implementing the discrepancy stopping rule might provide a very fast tool for image deblurring with automatic stopping of iterations. Potential applications are open to image deblurring in astronomy and microscopy.…”
Section: Deblurringsupporting
confidence: 60%
“…The GPU implementation of the algorithms is obtained by performing on the parallel device the main computational tasks (FFT computations and vector-vector operations) of each iteration. In this way, by running the same number of iterations with the serial and the parallel versions of the deconvolution algorithms, essentially the same reconstruction accuracy is obtained [12,29,39]. For each image size, the results reported in Table 4 and 5 are obtained as average values of ten test problems corresponding to different noise realizations.…”
Section: Gpu Testsmentioning
confidence: 83%
“…Thus the computational complexity depends on the number of the matrix-vector products Hx E ; H T z. These features make SGP well-suited to be implemented also on graphic processing units (GPUs) or on multiprocessor systems [32].…”
Section: Statement Of the Problemmentioning
confidence: 99%