Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The L1-Potts functional for robust jump-sparse reconstruction (1207.4642v3)

Published 19 Jul 2012 in math.OC, cs.NA, and math.NA

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

Citations (32)

Summary

We haven't generated a summary for this paper yet.