Paper
19 September 2017 A generalized Condat's algorithm of 1D total variation regularization
Author Affiliations +
Abstract
A common way for solving the denosing problem is to utilize the total variation (TV) regularization. Many efficient numerical algorithms have been developed for solving the TV regularization problem. Condat described a fast direct algorithm to compute the processed 1D signal. Also there exists a direct algorithm with a linear time for 1D TV denoising referred to as the taut string algorithm. The Condat’s algorithm is based on a dual problem to the 1D TV regularization. In this paper, we propose a variant of the Condat’s algorithm based on the direct 1D TV regularization problem. The usage of the Condat’s algorithm with the taut string approach leads to a clear geometric description of the extremal function. Computer simulation results are provided to illustrate the performance of the proposed algorithm for restoration of degraded signals.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Artyom Makovetskii, Sergei Voronin, and Vitaly Kober "A generalized Condat's algorithm of 1D total variation regularization", Proc. SPIE 10396, Applications of Digital Image Processing XL, 103962K (19 September 2017); https://doi.org/10.1117/12.2273618
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Denoising

Signal processing

Algorithm development

Computer simulations

Image restoration

RELATED CONTENT

Color image restoration based on camera microscanning
Proceedings of SPIE (September 23 2014)
Explicit solutions of one-dimensional total variation problem
Proceedings of SPIE (September 22 2015)
Total variation regularization with bounded linear variations
Proceedings of SPIE (September 28 2016)
Wavelet domain blind image separation
Proceedings of SPIE (November 13 2003)

Back to Top