The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
Abstract
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be implementable variants of the classical augmented Lagrangian method for optimization problems with separable structures and linear constraints. The proposed framework allows us to solve problems of image restoration, impulse noise removal, inpainting, and image cartoon+texture decomposition. As the constrained model is employed, we need only to input the noise level, and the estimation of the regularization parameter is not required in these imaging problems. Experimental results for such imaging problems are presented to illustrate the effectiveness of the proposed method. We show that the alternating direction method is very efficient for solving image restoration and reconstruction problems.
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.
Integrity signals
Registry
Cites
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.
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
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
On the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Banham, M. R., & Katsaggelos, A. K. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.581363 · Cited by 1,678
Iterative Methods for Total Variation Denoising
Vogel, C. R., & Oman, M. E. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917016 · Cited by 1,076
The Primal-Dual Active Set Strategy as a Semismooth Newton Method
Hintermüller, M., Ito, K., & Kunisch, K. K. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401383558 · Cited by 989
Image decomposition via the combination of sparse representations and a variational approach
Starck, J.-L., Elad, M., & Donoho, D. L. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.852206 · Cited by 987
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
Chan, T. F., Golub, G. H., & Mulet, P. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299767 · Cited by 840
Modeling Textures with Total Variation Minimization and Oscillating Patterns in Image Processing
Vese, L. A., & Osher, S. J. (2003) · Journal of Scientific Computing · doi:10.1023/a:1025384832106 · Cited by 660
Regularizing Flows for Constrained Matrix-Valued Images
Chefd'hotel, C., Tschumperlé, D., Deriche, R., & Faugeras, O. (2004) · Journal of Mathematical Imaging and Vision · doi:10.1023/b:jmiv.0000011920.58935.9c · Cited by 648
Structure-Texture Image Decomposition—Modeling, Algorithms, and Parameter Selection
Aujol, J.-F., Gilboa, G., Chan, T., & Osher, S. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-4331-z · Cited by 630
Image Decomposition and Restoration Using Total Variation Minimization and the H1
Osher, S., Solé, A., & Vese, L. (2003) · Multiscale Modeling & Simulation · doi:10.1137/s1540345902416247 · Cited by 613
A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Dual Norms and Image Decomposition Models
Aujol, J.-F., & Chambolle, A. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-4948-3 · Cited by 338
Deblurring Poissonian images by split Bregman techniques
Setzer, S., Steidl, G., & Teuber, T. (2010) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2009.10.006 · Cited by 336
Fukushima, M. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247655 · Cited by 227
A Fast Total Variation Minimization Method for Image Restoration
Huang, Y., Ng, M. K., & Wen, Y.-W. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070703533 · Cited by 218
Self-citationSecond-order Cone Programming Methods for Total Variation-Based Image Restoration
Goldfarb, D., & Yin, W. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040608982 · Cited by 196
On the Convergence of the Lagged Diffusivity Fixed Point Method in Total Variation Image Restoration
Chan, T. F., & Mulet, P. (1999) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142997327075 · Cited by 194
Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
Fu, H., Ng, M. K., Nikolova, M., & Barlow, J. L. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/040615079 · Cited by 179
Self-citationA computational algorithm for minimizing total variation in image restoration
Li, Y., & Santosa, F. (1996) · IEEE Transactions on Image Processing · doi:10.1109/83.503914 · Cited by 178
Daubechies, I., & Teschke, G. (2005) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2004.12.004 · Cited by 162
Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
Kunisch, K. K., & Hintermüller, M. (2004) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139903422784 · Cited by 159
Edge Direction Preserving Image Zooming: A Mathematical and Numerical Analysis
Malgouyres, F., & Guichard, F. (2001) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142999362286 · Cited by 156
Hintermüller, M., & Stadler, G. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/040613263 · Cited by 150
A variable-penalty alternating directions method for convex optimization
Kontogiorgis, S. A., & Meyer, R. R. (1998) · Mathematical Programming · doi:10.1007/bf02680549 · Cited by 144
He, B., & Yang, H. (1998) · Operations Research Letters · doi:10.1016/s0167-6377(98)00044-3 · Cited by 134
Are Natural Images of Bounded Variation?
Gousseau, Y., & Morel, J. (2001) · SIAM Journal on Mathematical Analysis · doi:10.1137/s0036141000371150 · Cited by 104
Cited by
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
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Self-citationSmooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
A Splitting-Based Iterative Algorithm for Accelerated Statistical X-Ray CT Reconstruction
Ramani, S., & Fessler, J. A. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2011.2175233 · Cited by 257
Metadata
- Authors
- Ng, M. K., Weiss, P., & Yuan, X.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2010-01
- Volume
- 32
- Issue
- 5
- Pages
- 2710-2736
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2067689904
- Cited by
- 266
- References
- 33
- FWCI
- 25.06
- 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
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.