The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Rudin-Osher-Fatemi Total Variation Denoising using Split Bregman
Open accessAbstract
Denoising is the problem of removing noise from an image. The most commonly studied case is with additive white Gaussian noise (AWGN), where the observed noisy image f is related to the underlying true image u by f=u+η and η is at each point in space independently and identically distributed as a zero-mean Gaussian random variable. Total variation (TV) regularization is a technique that was originally developed for AWGN image denoising by Rudin, Osher, and Fatemi. The TV regularization technique has since been applied to a multitude of other imaging problems, see for example Chan and Shen's book. We focus here on the split Bregman algorithm of Goldstein and Osher for TV-regularized denoising.
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
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
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
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
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
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
An Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
Oscillating Patterns in Image Processing and Nonlinear Evolution Equations
Meyer, Y. (2001) · University Lecture Series · doi:10.1090/ulect/022 · Cited by 1,037
Image Processing and Analysis: Variational, PDE, Wavelet, and Stochastic Methods
Chan, T. F., & Shen, J. (. (2005) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717877 · Cited by 915
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090756855 · Cited by 848
An Algorithm for Total Variation Minimization and Applications
Chambolle, A. (2004) · Journal of Mathematical Imaging and Vision · doi:10.1023/b:jmiv.0000011325.36760.1e · Cited by 832
Aspects of Total Variation Regularized L1Function Approximation
Chan, T. F., & Esedoglu, S. (2005) · SIAM Journal on Applied Mathematics · doi:10.1137/040604297 · Cited by 651
Galatsanos, N. P., & Katsaggelos, A. K. (1992) · IEEE Transactions on Image Processing · doi:10.1109/83.148606 · Cited by 500
A Variational Approach to Reconstructing Images Corrupted by Poisson Noise
Le, T., Chartrand, R., & Asaki, T. J. (2007) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-007-0652-y · Cited by 412
Recent Developments in Total Variation Image Restoration
Chan, T. F.-C., Esedoḡlu, S., Park, F., & Yip, A. M. (2004) · Cited by 297
Local Strong Homogeneity of a Regularized Estimator
Nikolova, M. (2000) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139997327794 · Cited by 291
Multiplicative Denoising and Deblurring: Theory and Algorithms
Rudin, L., Lions, P.-L., & Osher, S. (2006) · Geometric Level Set Methods in Imaging, Vision, and Graphics · doi:10.1007/0-387-21810-6_6 · Cited by 273
A convex relaxation approach for computing minimal partitions
Pock, T., Chambolle, A., Cremers, D., & Bischof, H. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206604 · Cited by 253
A variational formulation for frame-based inverse problems
Chaux, C., Combettes, P. L., Pesquet, J.-C., & Wajs, V. R. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/4/008 · Cited by 249
Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing
Setzer, S. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0357-3 · Cited by 221
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
Chambolle, A., & Darbon, J. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-009-0238-9 · Cited by 160
Duality-based algorithms for total-variation-regularized image restoration
Zhu, M., Wright, S. J., & Chan, T. F.-C. (2008) · Computational Optimization and Applications · doi:10.1007/s10589-008-9225-2 · Cited by 157
An efficient algorithm for image segmentation, Markov random fields and related problems
Hochbaum, D. S. (2001) · Journal of the ACM · doi:10.1145/502090.502093 · Cited by 156
A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise
Dong, Y., & Zeng, T. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120870621 · Cited by 135
Total Variation Inpainting using Split Bregman
Getreuer, P. (2012) · Image Processing On Line · doi:10.5201/ipol.2012.g-tvi · Cited by 104
Self-citationOn Semismooth Newton’s Methods for Total Variation Minimization
Ng, M. K., Qi, L., Yang, Y.-F., & Huang, Y. (2007) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-007-0650-0 · Cited by 89
Total Variation Deconvolution using Split Bregman
Getreuer, P. (2012) · Image Processing On Line · doi:10.5201/ipol.2012.g-tvdc · Cited by 78
Self-citationCombinatorial Continuous Maximum Flow
Couprie, C., Grady, L. J., Talbot, H., & Najman, L. A. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/100799186 · Cited by 33
Cited by
A Nonlocal Bayesian Image Denoising Algorithm
Lebrun, M., Buades, A., & Morel, J. M. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120874989 · Cited by 318
Deflecting Adversarial Attacks with Pixel Deflection
Prakash, A., Moran, N., Garber, S., DiLillo, A., & Storer, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00894 · Cited by 310
Metadata
- Authors
- Getreuer, P.
- Venue
- Image Processing On Line
- Publisher
- Image Processing On Line
- Published
- 2012-05-19
- Volume
- 2
- Pages
- 74-95
- ISSN
- 2105-1232 (ISSN-L)
- OpenAlex
- W2122192562
- Cited by
- 272
- References
- 36
- FWCI
- 21.31
- Type
- journal article
- Language
- en
- Open access
- diamond
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.