The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Total Variation Minimization and a Class of Binary MRF Models
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
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
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Exact Maximum A Posteriori Estimation for Binary Images
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01764.x · Cited by 1,055
Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
Chan, T. F., Esedoglu, S., & Nikolova, M. (2006) · SIAM Journal on Applied Mathematics · doi:10.1137/040615286 · Cited by 1,049
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
Self-citationMulti-camera Scene Reconstruction via Graph Cuts
Kolmogorov, V., & Zabih, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47977-5_6 · Cited by 739
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
Exact optimization for markov random fields with convex priors
Ishikawa, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233908 · Cited by 486
Cited by
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
Self-citationThe 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
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
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
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Phase Unwrapping via Graph Cuts
Bioucas-Dias, J. M., & Valadao, G. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.888351 · Cited by 572
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Self-citationNonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
Elmoataz, A., Lezoray, O., & Bougleux, S. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924284 · Cited by 466
An Improved Algorithm for TV-L 1 Optical Flow
Wedel, A., Pock, T., Zach, C., Bischof, H., & Cremers, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03061-1_2 · Cited by 423
Diagonal preconditioning for first order primal-dual algorithms in convex optimization
Pock, T., & Chambolle, A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126441 · Cited by 393
Self-citationAdaptive total variation image deblurring: A majorization–minimization approach
Oliveira, J. P., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.03.018 · Cited by 364
A Direct Algorithm for 1-D Total Variation Denoising
Condat, L. (2013) · IEEE Signal Processing Letters · doi:10.1109/lsp.2013.2278339 · Cited by 341
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
Handbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
Gradient-based algorithms with applications to signal-recovery problems
Beck, A., & Teboulle, M. (2009) · Convex Optimization in Signal Processing and Communications · doi:10.1017/cbo9780511804458.003 · Cited by 333
Sparse Modeling for Image and Vision Processing
Mairal, J. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781680830095 · Cited by 322
Structured Sparsity through Convex Optimization
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012) · Statistical Science · doi:10.1214/12-sts394 · Cited by 315
Removing Multiplicative Noise by Douglas-Rachford Splitting Methods
Steidl, G., & Teuber, T. (2010) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-009-0179-5 · Cited by 287
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Duality TV-L1 flow with fundamental matrix prior
Wedel, A., Pock, T., Braun, J., Franke, U., & Cremers, D. (2008) · 2008 23rd International Conference Image and Vision Computing New Zealand · doi:10.1109/ivcnz.2008.4762119 · Cited by 58
“An efficient algorithm is based on gradient descent and subsequent re-projection using the dualROF model [14].”
Method
Metadata
- Authors
- Chambolle, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 136-152
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1533665822
- Cited by
- 324
- References
- 15
- FWCI
- 9.38
- Type
- conference paper
- 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.