Publication

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Related publications (37)

Graph Chatbot

Chat with Graph Search

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.

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

An adaptive space-time algorithm for the incompressible Navier-Stokes equations

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm is presented to solve the incompressible Navier-Stokes equations. Time discretization is performed with the BDF2 method while continuous, piecewise linear anisotropic finite elements are used for the space discretization. Th ...

San Diego2023

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

EPFL2022

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Discrete-Choice Mining of Social Processes

Victor Kristof

Poor decisions and selfish behaviors give rise to seemingly intractable global problems, such as the lack of transparency in democratic processes, the spread of conspiracy theories, and the rise in greenhouse gas emissions. However, people are more predict ...

EPFL2021

, ,

The paper describes a novel implementation of the piecewise linear interface-capturing volume-of-fluid method (PLIC-VOF) in axisymmetric cylindrical coordinates. The principal innovative feature involved in this work is that both the forward and inverse re ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Solving Continuous-Domain Problems Exactly with Multiresolution B-Splines

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta, Thomas Jean Debarre

We propose a discretization method for continuous-domain linear inverse problems with multiple-order total-variation (TV) regularization. It is based on a recent result that proves that such inverse problems have sparse polynomial-spline solutions. Our met ...

IEEE2019

Solving Continuous-Domain Problems Exactly with Multiresolution B-Splines

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta, Thomas Jean Debarre

2019

Optimal errors and phase transitions in high-dimensional generalized linear models

Nicolas Macris, Florent Gérard Krzakala, Lenka Zdeborová, Jean François Emmanuel Barbier

Generalized linear models (GLMs) are used in high-dimensional machine learning, statistics, communications, and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing, error-corre ...

PNAS2019

We propose a method for modelling spatially dependent functional data, based on regression with differential regularization. The regularizing term enables to include problem-specific information about the spatio-temporal variation of phenomenon under study ...

2019