A Direct Algorithm for 1-D Total Variation Denoising

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.

[1]  Antonin Chambolle,et al.  On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows , 2009, International Journal of Computer Vision.

[2]  Thomas Brox,et al.  On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs , 2004, SIAM J. Numer. Anal..

[3]  Suvrit Sra,et al.  Fast Newton-type Methods for Total Variation Regularization , 2011, ICML.

[4]  Jean-Philippe Vert,et al.  The group fused Lasso for multiple change-point detection , 2011, 1106.4199.

[5]  Mingqiang Zhu,et al.  An Efficient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration , 2008 .

[6]  Jieping Ye,et al.  An efficient algorithm for a class of fused lasso problems , 2010, KDD.

[7]  Arne Kovac,et al.  Extensions of Smoothing via Taut Strings , 2008, 0803.2931.

[8]  K. Lange,et al.  A Path Algorithm for Constrained Estimation , 2011, Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America.

[9]  Antonin Chambolle,et al.  Total Variation Minimization and a Class of Binary MRF Models , 2005, EMMCVPR.

[10]  Laurent Condat.  A generic first-order primal-dual method for convex optimization involving Lipschitzian, proximable and linear composite terms , 2011 .

[11]  M. Nikolova.  An Algorithm for Total Variation Minimization and Applications , 2004 .

[12]  Laurent Condat,et al.  A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms , 2013, J. Optim. Theory Appl..

[13]  R. Tibshirani,et al.  Sparsity and smoothness via the fused lasso , 2005 .

[14]  Markus Grasmair,et al.  The Equivalence of the Taut String Algorithm and BV-Regularization , 2006, Journal of Mathematical Imaging and Vision.

[15]  ChambolleAntonin,et al.  On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows , 2009 .

[16]  Michael Unser,et al.  Generalized total variation denoising via augmented Lagrangian cycle spinning with Haar wavelets , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[17]  Alan S. Willsky,et al.  Nonlinear evolution equations as fast and exact solvers of estimation problems , 2005, IEEE Transactions on Signal Processing.

[18]  Curtis R. Vogel,et al.  Iterative Methods for Total Variation Denoising , 1996, SIAM J. Sci. Comput..

[19]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[20]  Stephen P. Boyd,et al.  An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems , 2012, 1203.1828.

[21]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[22]  Max A. Little,et al.  Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory , 2011, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[23]  Marc Teboulle,et al.  Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems , 2009, IEEE Transactions on Image Processing.

[24]  Dorit S. Hochbaum,et al.  An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization , 2011, SSVM.

[25]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[26]  R. Tibshirani,et al.  The solution path of the generalized lasso , 2010, 1005.1971.

[27]  Dimitri Van De Ville,et al.  A Signal Processing Approach to Generalized 1-D Total Variation , 2011, IEEE Transactions on Signal Processing.

[28]  Mohamed-Jalal Fadili,et al.  Unbiased risk estimation for sparse analysis regularization , 2012, 2012 19th IEEE International Conference on Image Processing.

[29]  R. Tibshirani,et al.  Spatial smoothing and hot spot detection for CGH data using the fused lasso. , 2008, Biostatistics.

[30]  Michael Elad,et al.  L1-L2 Optimization in Signal and Image Processing , 2010, IEEE Signal Processing Magazine.

[31]  Stephan Didas,et al.  Splines in Higher Order TV Regularization , 2006, International Journal of Computer Vision.

[32]  S. Geer,et al.  Locally adaptive regression splines , 1997 .

[33]  Rémi Gribonval,et al.  Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation? , 2011, IEEE Transactions on Signal Processing.

[34]  Brendt Wohlberg,et al.  An Iteratively Reweighted Norm Algorithm for Minimization of Total Variation Functionals , 2007, IEEE Signal Processing Letters.

[35]  A. Chambolle,et al.  An introduction to Total Variation for Image Analysis , 2009 .

[36]  P. Davies,et al.  Local Extremes, Runs, Strings and Multiresolution , 2001 .

[37]  Tony F. Chan,et al.  The digital TV filter and nonlinear denoising , 2001, IEEE Trans. Image Process..

[38]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[39]  Otmar Scherzer,et al.  Tube Methods for BV Regularization , 2003, Journal of Mathematical Imaging and Vision.

[40]  Andy M. Yip,et al.  Recent Developments in Total Variation Image Restoration , 2004 .

[41]  Julien Mairal,et al.  Optimization with Sparsity-Inducing Penalties , 2011, Found. Trends Mach. Learn..

[42]  Valeria Ruggiero,et al.  On the Convergence of Primal–Dual Hybrid Gradient Algorithms for Total Variation Image Restoration , 2012, Journal of Mathematical Imaging and Vision.

[43]  Max A. Little,et al.  Generalized methods and solvers for noise removal from piecewise constant signals. II. New methods , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[44]  Holger Hoefling.  A Path Algorithm for the Fused Lasso Signal Approximator , 2009, 0910.0526.

[45]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[46]  Michael Elad,et al.  Analysis versus synthesis in signal priors , 2006, 2006 14th European Signal Processing Conference.

[47]  Emmanuel J. Candès,et al.  Templates for convex cone problems with applications to sparse signal recovery , 2010, Math. Program. Comput..

[48]  R. Tibshirani,et al.  PATHWISE COORDINATE OPTIMIZATION , 2007, 0708.1485.

[49]  Charles Dossal,et al.  Local Behavior of Sparse Analysis Regularization: Applications to Risk Estimation , 2012, 1204.3212.

[50]  Michael Unser,et al.  MMSE Estimation of Sparse Lévy Processes , 2013, IEEE Transactions on Signal Processing.

[51]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[52]  Michael Unser,et al.  MMSE denoising of sparse Lévy processes via message passing , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[53]  Lionel Moisan,et al.  Total Variation as a Local Filter , 2011, SIAM J. Imaging Sci..

[54]  Antonin Chambolle,et al.  A Parametric Maximum Flow Approach for Discrete Total Variation Regularization , 2012 .