Share Email Print

Proceedings Paper

A generalized Condat's algorithm of 1D total variation regularization
Author(s): Artyom Makovetskii; Sergei Voronin; Vitaly Kober
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 September 2017
PDF: 8 pages
Proc. SPIE 10396, Applications of Digital Image Processing XL, 103962K (19 September 2017); doi: 10.1117/12.2273618
Show Author Affiliations
Artyom Makovetskii, Chelyabinsk State Univ. (Russian Federation)
Sergei Voronin, Chelyabinsk State Univ. (Russian Federation)
Vitaly Kober, Chelyabinsk State Univ. (Russian Federation)
CICESE (Mexico)

Published in SPIE Proceedings Vol. 10396:
Applications of Digital Image Processing XL
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?