Abstract

We investigate the non-smooth and non-convex L1L^1-Potts functional in discrete and continuous time. We show ΓΓ-convergence of discrete L1L^1-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete L1L^1-Potts problem, we introduce an O(n2)O(n^2) time and O(n)O(n) space algorithm to compute an exact minimizer. We apply L1L^1-Potts minimization to the problem of recovering piecewise constant signals from noisy measurements f.f. It turns out that the L1L^1-Potts functional has a quite interesting blind deconvolution property. In fact, we show that mildly blurred jump-sparse signals are reconstructed by minimizing the L1L^1-Potts functional. Furthermore, for strongly blurred signals and known blurring operator, we derive an iterative reconstruction algorithm.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.