Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,339

The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.

A unified treatment of some iterative algorithms in signal processing and image reconstruction

Open access
Byrne, Charles·2004·Inverse Problems

Abstract

Let T be a (possibly nonlinear) continuous operator on Hilbert space . If, for some starting vector x , the orbit sequence { T k x , k = 0,1,...} converges, then the limit z is a fixed point of T ; that is, Tz = z . An operator N on a Hilbert space is nonexpansive (ne) if, for each x and y in , Even when N has fixed points the orbit sequence { N k x } need not converge; consider the example N = − I , where I denotes the identity operator. However, for any the iterative procedure defined by converges (weakly) to a fixed point of N whenever such points exist. This is the Krasnoselskii–Mann (KM) approach to finding fixed points of ne operators. A wide variety of iterative procedures used in signal processing and image reconstruction and elsewhere are special cases of the KM iterative procedure, for particular choices of the ne operator N . These include the Gerchberg–Papoulis method for bandlimited extrapolation, the SART algorithm of Anderson and Kak, the Landweber and projected Landweber algorithms, simultaneous and sequential methods for solving the convex feasibility problem, the ART and Cimmino methods for solving linear systems of equations, the CQ algorithm for solving the split feasibility problem and Dolidze's procedure for the variational inequality problem for monotone operators.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0266-5611/20/1/006

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 43 references

Metadata

Authors
Byrne, C.
Venue
Inverse Problems
Published
2003-11-14
Volume
20
Issue
1
Pages
103-120
ISSN
  • 0266-5611 (ISSN-L)
  • 1361-6420
OpenAlex
W2100503136
Cited by
1,339
References
43
FWCI
10.56
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A unified treatment of some iterative algorithms in signal processing and image reconstruction. https://app.cochat.ai/papers/10.1088/0266-5611/20/1/006
The paper
Byrne, C. (2004). A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems. https://doi.org/10.1088/0266-5611/20/1/006

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.