Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We investigate the nonsmooth and nonconvex -Potts functional in discrete and continuous time. We show Γ-convergence of discrete -Potts functionals toward 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 O(n) 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 a known blurring operator, we derive an iterative reconstruction algorithm.
Victor Panaretos, Neda Mohammadi Jouzdani