Abstract
We investigate the non-smooth and non-convex -Potts functional in discrete and continuous time. We show -convergence of discrete -Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete -Potts problem, we introduce an time and space algorithm to compute an exact minimizer. We apply -Potts minimization to the problem of recovering piecewise constant signals from noisy measurements It turns out that the -Potts functional has a quite interesting blind deconvolution property. In fact, we show that mildly blurred jump-sparse signals are reconstructed by minimizing the -Potts functional. Furthermore, for strongly blurred signals and known blurring operator, we derive an iterative reconstruction algorithm.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.