We consider the problem of denoising a signal observed in Gaussian noise.In this problem, classical linear estimators are quasi-optimal provided that the set of possible signals is convex, compact, and known a priori. However, when the set is unspecified, designing an estimator which does not ``know'' the underlying structure of a signal yet has favorable theoretical guarantees of statistical performance remains a challenging problem. In this thesis, we study a new family of estimators for statistical recovery of signals satisfying certain time-invariance properties. Such signals are characterized by their harmonic structure, which is usually unknown in practice. We propose new estimators which are capable to exploit the unknown harmonic s...
International audienceWe consider the problem of recovering of continuous multi-dimensional function...
We want to exactly reconstruct a sparse signal f (a vector in R^n of small support) from fe...
Abstract The aim of the present paper is to give a general method allowing us to devise maximum-like...
We consider the problem of denoising a signal observed in Gaussian noise.In this problem, classical ...
International audienceWe present a theoretical framework for adaptive estimation and prediction of s...
Non-convex functionals have shown sharper results in signal reconstruction as compared to convex one...
International audienceWe consider the problem of recovering a signal observed in Gaussian noise. If ...
Reconstruction fidelity of sparse signals contaminated by sparse noise is considered. Statistical me...
The presented work is divided into three parts. At first, we show that the formalism of model select...
The research reported in this dissertation addresses the reconstruction of signals and images from l...
AbstractWe consider the problem of pointwise estimation of multi-dimensional signals s, from noisy o...
International audienceWe consider the problem of pointwise estimation of multi-dimensional signals $...
39 pagesWe discuss the problem of adaptive discrete-time signal denoising in the situation where the...
This chapter develops a theoretical analysis of the convex programming method for recovering a struc...
Recent advances in quantized compressed sensing and high-dimensional estimation have shown that sign...
International audienceWe consider the problem of recovering of continuous multi-dimensional function...
We want to exactly reconstruct a sparse signal f (a vector in R^n of small support) from fe...
Abstract The aim of the present paper is to give a general method allowing us to devise maximum-like...
We consider the problem of denoising a signal observed in Gaussian noise.In this problem, classical ...
International audienceWe present a theoretical framework for adaptive estimation and prediction of s...
Non-convex functionals have shown sharper results in signal reconstruction as compared to convex one...
International audienceWe consider the problem of recovering a signal observed in Gaussian noise. If ...
Reconstruction fidelity of sparse signals contaminated by sparse noise is considered. Statistical me...
The presented work is divided into three parts. At first, we show that the formalism of model select...
The research reported in this dissertation addresses the reconstruction of signals and images from l...
AbstractWe consider the problem of pointwise estimation of multi-dimensional signals s, from noisy o...
International audienceWe consider the problem of pointwise estimation of multi-dimensional signals $...
39 pagesWe discuss the problem of adaptive discrete-time signal denoising in the situation where the...
This chapter develops a theoretical analysis of the convex programming method for recovering a struc...
Recent advances in quantized compressed sensing and high-dimensional estimation have shown that sign...
International audienceWe consider the problem of recovering of continuous multi-dimensional function...
We want to exactly reconstruct a sparse signal f (a vector in R^n of small support) from fe...
Abstract The aim of the present paper is to give a general method allowing us to devise maximum-like...