The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
A Direct Algorithm for 1-D Total Variation Denoising
Open accessAbstract
A very fast noniterative algorithm is proposed for denoising or smoothing one-dimensional discrete signals, by solving the total variation regularized least-squares problem or the related fused lasso problem. A C code implementation is available on the web page of the author.
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
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
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
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
Sparsity and Smoothness Via the Fused Lasso
Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00490.x · Cited by 2,724
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
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
Pathwise coordinate optimization
Friedman, J., Hastie, T., Höfling, H., & Tibshirani, R. (2007) · The Annals of Applied Statistics · doi:10.1214/07-aoas131 · Cited by 1,895
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
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
Self-citationOptimization 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
Analysis versus synthesis in signal priors
Elad, M., Milanfar, P., & Rubinstein, R. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/007 · Cited by 698
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Templates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608
The solution path of the generalized lasso
Tibshirani, R. J., & Taylor, J. (2011) · The Annals of Statistics · doi:10.1214/11-aos878 · Cited by 553
L1-L2 Optimization in Signal and Image Processing
Zibulevsky, M., & Elad, M. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936023 · Cited by 426
Spatial smoothing and hot spot detection for CGH data using the fused lasso
Tibshirani, R., & Wang, P. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm013 · Cited by 347
Total Variation Minimization and a Class of Binary MRF Models
Chambolle, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11585978_10 · Cited by 324
Recent Developments in Total Variation Image Restoration
Chan, T. F.-C., Esedoḡlu, S., Park, F., & Yip, A. M. (2004) · Cited by 297
Local Extremes, Runs, Strings and Multiresolution
Davies, P. L., & Kovac, A. (2001) · The Annals of Statistics · doi:10.1214/aos/996986501 · Cited by 265
An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems
Wahlberg, B., Boyd, S., Annergren, M., & Wang, Y. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120711-3-be-2027.00310 · Cited by 256
Steidl, G., Weickert, J., Brox, T., Mrázek, P., & Welk, M. (2004) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142903422429 · Cited by 250
A Path Algorithm for the Fused Lasso Signal Approximator
Hoefling, H. (2010) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2010.09208 · Cited by 214
The group fused Lasso for multiple change-point detectionPreprint
Bleakley, K., & Vert, J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.4199 · Cited by 210
An efficient algorithm for a class of fused lasso problems
Liu, J., Yuan, L., & Ye, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835847 · Cited by 163
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
Little, M. A., & Jones, N. S. (2011) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2010.0671 · Cited by 118
An Iteratively Reweighted Norm Algorithm for Minimization of Total Variation Functionals
Wohlberg, B. E., & Rodríguez, P. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.906221 · Cited by 117
Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation?
Gribonval, R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2107908 · Cited by 116
Total Variation as a Local Filter
Louchet, C., & Moisan, L. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/100785855 · Cited by 95
On the Convergence of Primal–Dual Hybrid Gradient Algorithms for Total Variation Image Restoration
Bonettini, S., & Ruggiero, V. (2012) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-011-0324-9 · Cited by 86
Generalized methods and solvers for noise removal from piecewise constant signals. II. New methods
Little, M. A., & Jones, N. S. (2011) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2010.0674 · Cited by 81
Fast Newton-type Methods for Total Variation Regularization
Barbero, L., & Sra, S. (2011) · International Conference on Machine Learning · Cited by 76
Splines in Higher Order TV Regularization
Steidl, G., Didas, S., & Neumann, J. K. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-8066-7 · Cited by 67
A Signal Processing Approach to Generalized 1-D Total Variation
Karahanoğlu, F. I., Bayram, İ., & Ville, D. V. D. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2164399 · Cited by 64
Local behavior of sparse analysis regularization: Applications to risk estimation
Vaiter, S., Deledalle, C., Gabriel Peyré, A., Dossal, C., & Fadili, J. M. (2012) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.11.006 · Cited by 41
Generalized total variation denoising via augmented Lagrangian cycle spinning with Haar wavelets
Kamilov, U. S., Bostan, E., & Unser, M. A. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288032 · Cited by 9
Cited by
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Review of noise removal techniques in ECG signals
Chatterjee, S., Thakur, R. S., Yadav, R. N., Gupta, L., & Raghuvanshi, D. K. (2020) · IET Signal Processing · doi:10.1049/iet-spr.2020.0104 · Cited by 333
Total Variation Blind Deconvolution: The Devil Is in the Details
Perrone, D., & Favaro, P. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.372 · Cited by 280
“The proof exploits recent work of Condat [5], Strong and Chan [20] and the taut string algorithm of Davies and Kovacs [6].”
MethodA Clearer Picture of Total Variation Blind Deconvolution
Perrone, D., & Favaro, P. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2477819 · Cited by 109
Progressive evolution of thrust fold topography in the frontal Himalaya
Wahyudi, D. R., Sinclair, H. D., & Mudd, S. M. (2021) · Geomorphology · doi:10.1016/j.geomorph.2021.107717 · Cited by 18
Metadata
- Authors
- Condat, L.
- Venue
- IEEE Signal Processing Letters
- Published
- 2013-11
- Volume
- 20
- Issue
- 11
- Pages
- 1054-1057
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2050023599
- Cited by
- 341
- References
- 40
- FWCI
- 24.90
- Type
- journal article
- Language
- en
- Open access
- green
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.