Publication

B-Spline-Based Exact Discretization of Continuous-Domain Inverse Problems With Generalized TV Regularization

Publications associées (34)

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

Pakshal Narendra Bohra

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...
EPFL2024

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

Application of optimal spline subspaces for the removal of spurious outliers in isogeometric discretizations

Espen Sande

We show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly speaking, these optimal ...
ELSEVIER SCIENCE SA2022

Wavelet-Fourier CORSING techniques for multidimensional advection-diffusion-reaction equations

Fabio Nobile, Simone Brugiapaglia

We present and analyze a novel wavelet-Fourier technique for the numerical treatment of multidimensional advection–diffusion–reaction equations based on the COmpRessed SolvING (CORSING) paradigm. Combining the Petrov–Galerkin technique with the compressed ...
2020

Functional Inverse Problems on Spheres: Theory, Algorithms and Applications

Matthieu Martin Jean-André Simeoni

Many scientific inquiries in natural sciences involve approximating a spherical field -namely a scalar quantity defined over a continuum of directions- from generalised samples of the latter (e.g. directional samples, local averages, etc). Such an approxim ...
EPFL2020

Continuous-Domain Signal Reconstruction Using L-p-Norm Regularization

Michaël Unser, Pakshal Narendra Bohra

We focus on the generalized-interpolation problem. There, one reconstructs continuous-domain signals that honor discrete data constraints. This problem is infinite-dimensional and ill-posed. We make it well-posed by imposing that the solution balances data ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

TV-based reconstruction of periodic functions

Julien René Pierre Fageot, Matthieu Martin Jean-André Simeoni

We introduce a general framework for the reconstruction of periodic multivariate functions from finitely many and possibly noisy linear measurements. The reconstruction task is formulated as a penalized convex optimization problem, taking the form of a sum ...
IOP PUBLISHING LTD2020

Sparse Dictionaries for Continuous-Domain Inverse Problems

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We study 1D continuous-domain inverse problems for multicomponent signals. The prior assumption on these signals is that each component is sparse in a different dictionary specified by a regularization operators. We introduce a hybrid regularization functi ...
2019

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

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 ...
2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.