Papers › Revisit 1D Total Variation restoration problem with new real-time algorithms for...

Revisit 1D Total Variation restoration problem with new real-time algorithms for signal and hyper-parameter estimations

17 Dec 2020arXiv:2012.09481archive 2025-07-28

Zhanhao Liu, Marion Perrodin, Thomas Chambrion, Radu Stoica

1D Total Variation (TV) denoising, considering the data fidelity and the Total Variation (TV) regularization, proposes a good restored signal preserving shape edges. The main issue is how to choose the weight λ balancing those two terms. In practice, this parameter is selected by assessing a list of candidates (e.g. cross validation), which is inappropriate for the real time application. In this work, we revisit 1D Total Variation restoration algorithm proposed by Tibshirani and Taylor. A heuristic method is integrated for estimating a good choice of λ based on the extremums number of restored signal. We propose an offline version of restoration algorithm in O(n log n) as well as its online implementation in O(n). Combining the rapid algorithm and the automatic choice of λ, we propose a real-time automatic denoising algorithm, providing a large application fields. The simulations show that our proposition of λ has a similar performance as the states of the art.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Denoising

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections