Signal averaging is the process that consists in computing a mean shape from
a set of noisy signals. In the presence of geometric variability in time in the
data, the usual Euclidean mean of the raw data yields a mean pattern that does
not reflect the typical shape of the observed signals. In this setting, it is
necessary to use alignment techniques for a precise synchronization of the
signals, and then to average the aligned data to obtain a consistent mean
shape.
We consider the problem of estimating a mean shape from a set of J planar
configurations described by a sequence of k landmarks. We study the consistency
of a smoothed Procrustean mean when the observations obey a deformable model
including some nuisance parameters such as random translations, rotations and
scaling. The main contribution of the paper is to analyze the influence of the
dimension k of the data and of the number J of observed configurations on the
convergence of the smoothed Procrustean estimator to the mean pattern of the
model.
This paper considers the problem of estimating a mean pattern in the setting
of Grenander's pattern theory. Shape variability in a data set of curves or
images is modeled by the random action of elements in a compact Lie group on an
infinite dimensional space. In the case of observations contaminated by an
additive Gaussian white noise, it is shown that estimating a reference template
in the setting of Grenander's pattern theory falls into the category of
deconvolution problems over Lie groups.
This paper considers the problem of adaptive estimation of a non-homogeneous
intensity function from the observation of n independent Poisson processes
having a common intensity that is randomly shifted for each observed
trajectory. We show that estimating this intensity is a deconvolution problem
for which the density of the random shifts plays the role of the convolution
operator. In an asymptotic setting where the number n of observed trajectories
tends to infinity, we derive upper and lower bounds for the minimax quadratic
risk over Besov balls.
This paper considers the problem of adaptive estimation of a mean pattern in
a randomly shifted curve model. We show that this problem can be transformed
into a linear inverse problem, where the density of the random shifts plays the
role of a convolution operator. An adaptive estimator of the mean pattern,
based on wavelet thresholding is proposed. We study its consistency for the
quadratic risk as the number of observed curves tends to infinity, and this
estimator is shown to achieve a near-minimax rate of convergence over a large
class of Besov balls.
In this paper, we consider the Group Lasso estimator of the covariance matrix
of a stochastic process corrupted by an additive noise. We propose to estimate
the covariance matrix in a high-dimensional setting under the assumption that
the process has a sparse representation in a large dictionary of basis
functions. Using a matrix regression model, we propose a new methodology for
high-dimensional covariance matrix estimation based on empirical contrast
regularization by a group Lasso penalty.
A new class of statistical deformable models is introduced to study
high-dimensional curves or images. These models are useful to analyze the
geometric modes of variation of a data set around a common mean pattern. It is
shown that an appropriate tool for statistical inference in such models is the
notion of empirical Fr\'echet mean. This leads to a new procedure to construct
a mean pattern from a set of curves or images, and to estimate the shape
variability of such data.
In this paper, we study the problem of nonparametric adaptive estimation of
the covariance function of a stationary Gaussian process. For this purpose, we
consider a wavelet-based method which combines the ideas of wavelet
approximation and estimation by information projection in order to warrants the
positive semidefiniteness property of the solution. The spectral density of the
process is estimated by projecting the wavelet thresholding expansion of the
periodogram onto a family of exponential functions. This ensures that the
spectral density estimator is a strictly positive function.
This paper considers the problem of adaptive estimation of a template in a
randomly shifted curve model. Using the Fourier transform of the data, we show
that this problem can be transformed into a stochastic linear inverse problem.
Our aim is to approach the estimator that has the smallest risk on the true
template over a finite set of linear estimators defined in the Fourier domain.
Based on the principle of unbiased empirical risk minimization, we derive a
nonasymptotic oracle inequality in the case where the law of the random shifts
is known.
We propose a model selection approach for covariance estimation of a
multi-dimensional stochastic process. Under very general assumptions, observing
i.i.d replications of the process at fixed observation points, we construct an
estimator of the covariance function by expanding the process onto a collection
of basis functions. We study the non asymptotic property of this estimate and
give a tractable way of selecting the best estimator among a possible set of
candidates. The optimality of the procedure is proved via an oracle inequality
which warrants that the best model is selected.
We propose a model selection approach for covariance estimation of a
multi-dimensional stochastic process. Under very general assumptions, observing
i.i.d replications of the process at fixed observation points, we construct an
estimator of the covariance function by expanding the process onto a collection
of basis functions. We study the non asymptotic property of this estimate and
give a tractable way of selecting the best estimator among a possible set of
candidates. The optimality of the procedure is proved via an oracle inequality
which warrants that the best model is selected.