A direct algorithm for 1-D total variation denoising

IEEE Signal Processing Letters

Volumn 20, Issue 11, 2013, Pages 1054-1057

  Condat, Laurent ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

Convex nonsmooth optimization; denoising; fused lasso; nonlinear smoothing; nonparametric regression; regularized least squares; taut string; total variation

Indexed keywords

DE-NOISING; FUSED LASSOS; LEAST SQUARE; NON-LINEAR SMOOTHING; NON-PARAMETRIC REGRESSION; NONSMOOTH OPTIMIZATION; TAUT-STRING; TOTAL VARIATION;

IMAGE DENOISING;

ALGORITHMS;

EID: 84884390219     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2013.2278339     Document Type: Article

References (38)

1. M. A. Little and N. S. Jones, "Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory & II. New methods," Proc. R. Soc. A, vol. 467, 2011.
2. S. Vaiter, C.-A. Deledalle, G. Peyré, C. Dossal, and J. Fadili, "Local behavior of sparse analysis regularization: Applications to risk estimation," Appl. and Computat. Harmon. Anal., 2013, to be published.
3. L. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation based noise removal algorithms," Physica D, vol. 60, no. 1-4, pp. 259-268, 1992.
4. A. Chambolle, V. Caselles,D. Cremers,M.Novaga, and T. Pock, "An introduction to total variation for image analysis," in Theoretical Foundations and Numerical Methods for Sparse Recovery, ser. Radon Series Comp. Appl. Math. Berlin, Germany: De Gruyter, 2010, vol. 9, pp. 263-340.
5. R.Gribonval, "Should penalized least squares regression be interpreted as maximum a posteriori estimation?," IEEE Trans. Signal Process., vol. 59, no. 5, pp. 2405-2410, May 2011.
6. U. S. Kamilov, P. Pad, A. Amini, and M. Unser, "MMSE estimation of sparse Lévy processes," IEEE Trans. Signal Process., vol. 61, no. 1, pp. 137-147, Jan. 2013.
7. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight, "Sparsity and smoothness via the fused lasso," J. R. Statist. Soc. B, vol. 67, no. 1, pp. 91-108, 2005. (Pubitemid 40167043)
8. R. Tibshirani and P. Wang, "Spatial smoothing and hot spot detection for CGH data using the fused lasso," Biostatistics, vol. 9, pp. 18-29, 2008. (Pubitemid 350274579)
9. J. Friedman, T. Hastie, H. Höfling, and R. Tibshirani, "Pathwise coordinate optimization," Ann. Appl. Statist., vol. 1, no. 2, pp. 302-332, 2007.
10. K. Bleakley and J.-P. Vert, "The group fused lasso for multiple changepoint detection," PUBLICATION NAME?, Jun. 2011, to be published.
11. H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces. New York, NY, USA: Springer, 2011.
12. C. R. Vogel and M. E. Oman, "Iterative methods for total variation denoising," SIAM J. Sci. Comput., vol. 17, pp. 227-238, 1996. (Pubitemid 126621162)
13. T. F. Chan, S. Osher, and J. Shen, "The digital TV filter and nonlinear denoising," IEEE Trans. Image Process., vol. 10, no. 2, pp. 231-241, Feb. 2001. (Pubitemid 33777271)
14. A. Chambolle, "Total variationminimization and a class of binary MRF models," in Energy MinimizationMethods in Computer Vision and Pattern Recognition , 2005, vol. LNCS-3757, pp. 136-152. (Pubitemid 43722931)
15. T. Chan, S. Esedoglu, F. Park, and M. Yip, "Recent developments in total variation image restoration," in Mathematical Models of Computer Vision, N. Paragios, Y. Chen, and O. Faugeras, Eds. Berlin, Germany: Springer Verlag, 2005.
16. B. Wohlberg and P. Rodriguez, "An iteratively reweighted norm algorithm for minimization of total variation functionals," IEEE Signal Process. Lett., vol. 14, no. 12, pp. 948-951, 2007. (Pubitemid 350201251)
17. M. Zibulevsky and M. Elad, "L1-L2 optimization in signal and image processing," IEEE Signal Process. Mag., vol. 27, no. 3, pp. 76-88, 2010.
18. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, "Optimization with sparsity-inducing penalties," Found. Trends Mach. Learn., vol. 4, no. 1, pp. 1-106, 2012.
19. A. Beck and M. Teboulle, "Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems," IEEE Trans. Image Process., vol. 18, no. 11, pp. 2419-2434, Nov. 2009.
20. A. Chambolle and T. Pock, "A first-order primal-dual algorithm for convex problems with applications to imaging," J. Math. Imag. Vis., vol. 40, no. 1, pp. 120-145, 2011.
21. L. Condat, "A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms," J. Optim. Theory Applicat., vol. 158, no. 2, pp. 460-479, 2013.
22. A. Chambolle and J. Darbon, "On total variation minimization and surface evolution using parametric maximal flows," Int. J. Comput. Vis., vol. 84, no. 3, 2009.
23. A. Chambolle and J. Darbon, "A parametric maximum flow approach for discrete total variation regularization," in Image Processing and Analysis With Graphs: Theory and Practice, R. Lukac, Ed. Boca Raton, FL, USA: CRC/Taylor and Francis, 2012, Digital Imaging and Computer Vision.
24. D. S. Hochbaum, "An efficient and effective tool for image segmentation, total variations and regularization," in Proc. Int. Conf. Scale Space and VariationalMethods in Computer Vision (SSVM), 2011, vol. LNCS 6667, pp. 338-349.
25. C. Louchet and L. Moisan, "Total variation as a local filter," SIAM J. Imag. Sci., vol. 4, no. 2, pp. 651-694, 2011.
26. P. L. Davies and A. Kovac, "Local extremes, runs, strings and multiresolution," Ann. Statist., vol. 29, no. 1, pp. 1-65, 2001.
27. E. Mammen and S. van de Geer, "Locally adaptive regression splines," Ann. Statist., vol. 25, no. 1, pp. 387-413, 1997.
28. M. Grasmair, "The equivalence of the taut string algorithm and BV-regularization," J. Math. Imag. Vis., vol. 27, no. 1, pp. 59-66, 2007. (Pubitemid 46122369)
29. W. Hinterberger,M. Hintermüller, K. Kunisch, M. von Oehsen, and O. Scherzer, "Tube methods for BV regularization," J. Math. Imag. Vis., vol. 19, no. 3, pp. 219-235, 2003.
30. G. Steidl, J.Weickert, T. Brox, P.Mrazek, andM.Welk, "On the equivalence of soft wavelet shrinkage, total variation diffusion, total variation regularization, and SIDEs," SIAM J. Numer. Anal., vol. 42, no. 2, pp. 686-713, 2004. (Pubitemid 40645211)
31. L. Dümbgen and A. Kovac, "Extensions of smoothing via taut strings," Electron. J. Statist., vol. 3, pp. 41-75, 2009.
32. J. Liu, L. Yuan, and J. Ye, "An efficient algorithm for a class of fused lasso problems," in Proc. ACM SIGKDD, 2010, pp. 323-332.
33. A. Barbero and S. Sra, "Fast Newton-type methods for total variation regularization," in Proc. Int. Conf. Mach. Learning (ICML), Jun. 2011, pp. 313-320.
34. B. Wahlberg, S. Boyd, M. Annergren, and Y. Wang, "An ADMM algorithm for a class of total variation regularized estimation problems," in Proc. IFAC Symp. System Identification, Jul. 2012.
35. H. Höfling, "A path algorithm for the fused lasso signal approximator," J. Computat. Graphical Statist., vol. 19, no. 4, pp. 984-1006, 2010.
36. R. J. Tibshirani and J. Taylor, "The solution path of the generalized lasso," Ann. Statist., vol. 39, no. 3, pp. 1335-1371, 2011.
37. H. Zhou and K. Lange, "A path algorithm for constrained estimation," J. Comput. Graph. Statist., vol. 22, no. 2, pp. 261-283, 2013.
38. I. Pollak, A. S.Willsky, and Y. Huang, "Nonlinear evolution equations as fast and exact solvers of estimation problems," IEEE Trans. Signal Process., vol. 53, no. 2, pp. 484-498, Feb. 2005. (Pubitemid 40181745)