EPFL
 Biomedical Imaging GroupSTI
EPFL
  Publications
English only   BIG > Publications > TV Regularization


 CONTENTS
 Home Page
 News & Events
 People
 Publications
 Tutorials and Reviews
 Research
 Demos
 Download Algorithms

 DOWNLOAD
 PDF
 Postscript
 All BibTeX References

Exact Algorithms for L1-TV Regularization of Real-Valued or Circle-Valued Signals

M. Storath, A. Weinmann, M. Unser

SIAM Journal on Scientific Computing, vol. 38, no. 1, pp A614-A630, 2016.



We consider L1-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we derive exact algorithms for both data spaces. A key ingredient is the reduction of the infinite search spaces to a finite set of configurations, which can be scanned by the Viterbi algorithm. To reduce the computational complexity of the involved tabulations, we extend the technique of distance transforms to nonuniform grids and to the circular data space. In total, the proposed algorithms have complexity 𝒪(KN) where N is the length of the signal and K is the number of different values in the data set. In particular, the complexity is 𝒪(N) for quantized data. It is the first exact algorithm for total variation regularization with circle-valued data, and it is competitive with the state-of-the-art methods for scalar data, assuming that the latter are quantized.


@ARTICLE(http://bigwww.epfl.ch/publications/storath1601.html,
AUTHOR="Storath, M. and Weinmann, A. and Unser, M.",
TITLE="Exact Algorithms for $L^{1}$-TV Regularization of Real-Valued or
        Circle-Valued Signals",
JOURNAL="{SIAM} Journal on Scientific Computing",
YEAR="2016",
volume="38",
number="1",
pages="A614--A630",
month="",
note="")

© 2016 SIAM. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from SIAM.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.