Constrained SART algorithm for inverse problems in image reconstruction (Q1951304)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constrained SART algorithm for inverse problems in image reconstruction |
scientific article; zbMATH DE number 6170725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained SART algorithm for inverse problems in image reconstruction |
scientific article; zbMATH DE number 6170725 |
Statements
Constrained SART algorithm for inverse problems in image reconstruction (English)
0 references
5 June 2013
0 references
The authors investigate the simultaneous algebraic reconstruction technique (SART) algorithm for solving iteratively least squares problems arising in image reconstruction problems. For the convergence proof results for a general projection method presented by \textit{A.~Nicola, S.~Petra, C.~Popa} and \textit{C.~Schnörr} [Int. J. Comput. Math. 89, No. 2, 231-253 (2012; Zbl 1256.65027)] are used. Additionally, the convergence of a constrained version of the SART algorithm is proved. For two special constraining functions it is shown that they satisfy the assumptions made for the constrained algorithm considered. Finally, the SART algorithm with and without constraints is compared with some versions of the Kaczmarz algorithm. An advantage of the SART algorithm is that it is parallelizable.
0 references
SART algorithm
0 references
Kaczmarz algorithm
0 references
least squares problems
0 references
image reconstruction
0 references
simultaneous algebraic reconstruction technique (SART)
0 references
convergence
0 references
0.9071391
0 references
0.8909489
0 references
0 references
0.8902817
0 references
0.8856283
0 references
0.88159764
0 references
0.87892145
0 references