Convex set theoretic image recovery with inexact projection algorithms
In image recovery, convex projection methods have been in use for almost two decades. However, while it is well known that projections can seldom be computed exactly, the effect of inexact projections on the behavior of such methods has not yet been investigated. We propose such an analysis and esta...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In image recovery, convex projection methods have been in use for almost two decades. However, while it is well known that projections can seldom be computed exactly, the effect of inexact projections on the behavior of such methods has not yet been investigated. We propose such an analysis and establish conditions on the projection errors under which the theoretical convergence properties of various algorithms remain valid. Our analysis covers sequential, parallel, and block-iterative (subgradient) projection methods for consistent and inconsistent set theoretic image recovery problems. It is shown in particular that parallel projection methods are more robust to errors than sequential methods such as the popular POCS (projection on to convex sets) algorithm. |
---|---|
DOI: | 10.1109/ICIP.2001.959002 |