The DOI matches its Crossref record; its reference list is not available.
A Fast Total Variation Minimization Method for Image Restoration
Open accessAbstract
In this paper, we study a fast total variation minimization method for image restoration. In the proposed method, we use the modified total variation minimization scheme to denoise the deblurred image. An alternating minimization algorithm is employed to solve the proposed total variation minimization problem. Our experimental results show that the quality of restored images by the proposed method is competitive with those restored by the existing total variation restoration methods. We show the convergence of the alternating minimization algorithm and demonstrate that the algorithm is very efficient.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Avoids the delta kernel solution”
From A Comprehensive Review of Blind Deconvolution Techniques for Image Deblurring (2020) · cites this paper as [35]
In the citing paper
“Converges to a global minimum”
From A Comprehensive Review of Blind Deconvolution Techniques for Image Deblurring (2020) · cites this paper as [35]
Citations
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 23 · Cited by 218
Research works printed but not linked: 29
- J. Bect, L. Blanc Féraud, G. Aubert, and A. Chambolle, A $l^1$-unified variational framework for image restoration , in Proceedings of the 8th European Conference on Computer Vision (Prague, 2004), Lecture Notes in Comput. Sci. 3024, Springer, Berlin, 2004, pp. 1–13. · DOI
- 10.1109/TIP.2007.909319 · DOI · Paper page
- J. Carter, Dual Methods for Total Variation-Based Image Restoration , Ph.D. thesis, UCLA, Los Angeles, CA, 2002.
- 10.1023/B:JMIV.0000011325.36760.1e · DOI
- A. Chambolle, Total variation minimization and a class of binary MRF models , in Energy Minimization Methods in Computer Vision and Pattern Recognition, Lecture Notes in Comput. Sci. 3757, Springer, Berlin, 2005, pp. 136–152. · DOI
- 10.1109/83.791976 · DOI
- 10.1137/050644999 · DOI
- 10.1137/S1064827596299767 · DOI
- 10.1137/S0036142997327075 · DOI
- 10.1016/j.acha.2006.09.005 · DOI
- 10.1137/050626090 · DOI
- 10.1002/cpa.20042 · DOI · Paper page
- 10.1109/TIP.2003.814255 · DOI
- 10.1137/040615079 · DOI
- 10.1137/S1052623401383558 · DOI
- 10.1137/S0036139903422784 · DOI
- 10.1137/040613263 · DOI
- Krishnan D., 2006, Commun. Comput. Phys., 1, 847, 10.4208/cicp.2006.v1.p847 · DOI
- 10.1109/83.503914 · DOI
- 10.1137/030601272 · DOI
- 10.1109/TIP.2004.834662 · DOI
- Y. Nesterov, Smooth minimization of non-smooth functions , Math. Program. Ser. A, 103 (2005) pp. 127–152. · DOI
- M. Ng, Iterative Methods for Toeplitz Systems , Oxford University Press, New York, 2004. · DOI
- 10.1137/S1064827598341384 · DOI
- 10.1007/s10851-007-0650-0 · DOI
- 10.1090/S0002-9904-1967-11761-0 · DOI
- 10.1016/0167-2789(92)90242-F · DOI
- 10.1023/A:1025384832106 · DOI
- 10.1137/0917016 · DOI
Metadata
- Authors
- Huang, Y., Ng, M. K., & Wen, Y.-W.
- Affiliations
- Hong Kong Baptist University (HK)
- South China Agricultural University (CN)
- Venue
- Multiscale Modeling & Simulation
- Published
- 2008-01
- Volume
- 7
- Issue
- 2
- Pages
- 774-795
- ISSN
- 1540-3459 (ISSN-L)
- 1540-3467
- OpenAlex
- W1972406935
- Cited by
- 218
- References
- 23
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 7 · 2023: 13 · 2022: 9 · 2021: 10 · 2020: 8 · 2019: 11 · 2018: 11 · 2017: 11 · 2016: 15 · 2015: 18 · 2014: 13 · 2013: 17 · 2012: 18
- FWCI
- 23.83
- Type
- journal article
- Language
- en
- Open access
- green
- ir.lzu.edu.cn
- Licence
- cc-by-nc-nd
- Locations
- Multiscale Modeling and Simulation (publishedVersion)
- Lanzhou University Institutional Repository (submittedVersion, cc-by-nc-nd)
- National University of Singapore (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Signal Denoising Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image Processing Techniques
- Physical Sciences › Mathematics › Mathematical Physics › Numerical methods in inverse problems
- Keywords
- total variation minimization, image restoration, image denoising, image deblurring, alternating minimization algorithm, convergence analysis, fast algorithms
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 Fast Total Variation Minimization Method for Image Restoration. https://app.cochat.ai/papers/10.1137/070703533
- The paper
- Huang, Y., Ng, M. K., & Wen, Y.-W. (2008). A Fast Total Variation Minimization Method for Image Restoration. Multiscale Modeling & Simulation. https://doi.org/10.1137/070703533
