A Direct Algorithm for 1-D Total Variation Denoising

Laurent Condat · IEEE Signal Processing Letters · 2013

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.

Read the paper · More papers on PaperTik