The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
Abstract
Recently, the minimization of a sum of two convex functions has received considerable interest in a variational image restoration model. In this paper, we propose a general algorithmic framework for solving a separable convex minimization problem from the point of view of fixed point algorithms based on proximity operators (Moreau 1962 C. R. Acad. Sci., Paris I 255 2897–99). Motivated by proximal forward–backward splitting proposed in Combettes and Wajs (2005 Multiscale Model. Simul. 4 1168–200) and fixed point algorithms based on the proximity operator (FP 2 O) for image denoising (Micchelli et al 2011 Inverse Problems 27 45009–38), we design a primal–dual fixed point algorithm based on the proximity operator (PDFP 2 O κ for κ ∈ [0, 1)) and obtain a scheme with a closed-form solution for each iteration. Using the firmly nonexpansive properties of the proximity operator and with the help of a special norm over a product space, we achieve the convergence of the proposed PDFP 2 O κ algorithm. Moreover, under some stronger assumptions, we can prove the global linear convergence of the proposed algorithm. We also give the connection of the proposed algorithm with other existing first-order methods. Finally, we illustrate the efficiency of PDFP 2 O κ through some numerical examples on image supper-resolution, computerized tomographic reconstruction and parallel magnetic resonance imaging. Generally speaking, our method PDFP 2 O (κ = 0) is comparable with other state-of-the-art methods in numerical performance, while it has some advantages on parameter selection in real applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Principles of Computerized Tomographic Imaging
Kak, A. C., & Slaney, M. (2001) · doi:10.1137/1.9780898719277 · Cited by 5,809
Cited by
Komodakis, N., & Pesquet, J.-C. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2377273 · Cited by 419
Metadata
- Authors
- Chen, P., Huang, J., & Zhang, X.
- Venue
- Inverse Problems
- Publisher
- IOP Publishing
- Published
- 2013-01-21
- Volume
- 29
- Issue
- 2
- Pages
- 025011
- ISSN
- 0266-5611 (ISSN-L)
- 1361-6420
- OpenAlex
- W2107941784
- Cited by
- 224
- References
- 2
- FWCI
- 14.87
- Type
- journal article
- Language
- en
- Open access
- closed
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 primal–dual fixed point algorithm for convex separable minimization with applications to image restoration. https://app.cochat.ai/papers/10.1088/0266-5611/29/2/025011
- The paper
- Chen, P., Huang, J., & Zhang, X. (2013). A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Problems. https://doi.org/10.1088/0266-5611/29/2/025011
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.