Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections

A block‐iterative projection algorithm for solving the consistent convex feasibility problem in a finite‐dimensional Euclidean space that is resilient to bounded and summable perturbations (in the sense that convergence to a feasible point is retained even if such perturbations are introduced in eac...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International transactions in operational research Ročník 16; číslo 4; s. 505 - 524
Hlavní autoři: Davidi, R., Herman, G.T., Censor, Y.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford, UK Blackwell Publishing Ltd 01.07.2009
Témata:
Algorithms
block-iterative algorithms
convex feasibility
Euclidean space
image reconstruction
Operations research
perturbation resilience
product space
projection methods
Studies
superiorization
ISSN:0969-6016, 1475-3995
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A block‐iterative projection algorithm for solving the consistent convex feasibility problem in a finite‐dimensional Euclidean space that is resilient to bounded and summable perturbations (in the sense that convergence to a feasible point is retained even if such perturbations are introduced in each iterative step of the algorithm) is proposed. This resilience can be used to steer the iterative process towards a feasible point that is superior in the sense of some functional on the points in the Euclidean space having a small value. The potential usefulness of this is illustrated in image reconstruction from projections, using both total variation and negative entropy as the functional.
Bibliografie:istex:A3B76A7932080D73AC3F7961D95D4763E6BCA2A1
ArticleID:ITOR695
ark:/67375/WNG-69C03G74-T
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0969-6016
1475-3995
DOI:10.1111/j.1475-3995.2009.00695.x