English
Related papers

Related papers: Smoothness-Penalized Deconvolution (SPeD) of a Den…

200 papers

Density deconvolution is the task of estimating a probability density function given only noise-corrupted samples. We can fit a Gaussian mixture model to the underlying density by maximum likelihood if the noise is normally distributed, but…

Machine Learning · Statistics 2020-07-14 Tim Dockhorn , James A. Ritchie , Yaoliang Yu , Iain Murray

The problem of sparse multichannel blind deconvolution (S-MBD) arises frequently in many engineering applications such as radar/sonar/ultrasound imaging. To reduce its computational and implementation cost, we propose a compression method…

Signal Processing · Electrical Eng. & Systems 2023-07-05 Bahareh Tolooshams , Satish Mulleti , Demba Ba , Yonina C. Eldar

We study the multivariate deconvolution problem of recovering the distribution of a signal from independent and identically distributed observations additively contaminated with random errors (noise) from a known distribution. For errors…

Statistics Theory · Mathematics 2023-09-28 Judith Rousseau , Catia Scricciolo

We study the reknown deconvolution problem of recovering a distribution function from independent replicates (signal) additively contaminated with random errors (noise), whose distribution is known. We investigate whether a Bayesian…

Statistics Theory · Mathematics 2021-11-15 Judith Rousseau , Catia Scricciolo

In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…

Statistics Theory · Mathematics 2025-10-07 Henrik Kaiser

In reliability theory and survival analysis, observed data are often weakly dependent and subject to additive measurement errors. Such contamination arises when the underlying data are neither independent nor strongly mixed but instead…

Statistics Theory · Mathematics 2025-03-20 Benjrada Mohammed Essalih

In the past decades, the growing amount of network data has lead to many novel statistical models. In this paper we consider so called geometric networks. Typical examples are road networks or other infrastructure networks. But also the…

Methodology · Statistics 2020-02-25 Marc Schneble , Göran Kauermann

We introduce methods for estimating the spectral density of a random field on a $d$-dimensional lattice from incomplete gridded data. Data are iteratively imputed onto an expanded lattice according to a model with a periodic covariance…

Methodology · Statistics 2019-08-12 Joseph Guinness

The empirical Bayes $g$-modeling approach via the nonparametric maximum likelihood estimator (NPMLE) is widely used for large-scale estimation and inference in the normal means problem, yet theoretical guarantees for uncertainty…

Statistics Theory · Mathematics 2026-03-31 Taehyun Kim , Bodhisattva Sen

This study addresses the blind deconvolution problem with modulated inputs, focusing on a measurement model where an unknown blurring kernel $\boldsymbol{h}$ is convolved with multiple random modulations…

Information Theory · Computer Science 2025-03-07 Song Li , Yu Xia

Stein's unbiased risk estimate (SURE) was proposed by Stein for the independent, identically distributed (iid) Gaussian model in order to derive estimates that dominate least-squares (LS). In recent years, the SURE criterion has been…

Methodology · Statistics 2009-11-13 Yonina C. Eldar

In this paper we study the problem of density deconvolution under general assumptions on the measurement error distribution. Typically deconvolution estimators are constructed using Fourier transform techniques, and it is assumed that the…

Statistics Theory · Mathematics 2020-02-04 Denis Belomestny , Alexander Goldenshluger

This paper studies sparse density estimation via $\ell_1$ penalization (SPADES). We focus on estimation in high-dimensional mixture models and nonparametric adaptive density estimation. We show, respectively, that SPADES can recover, with…

Statistics Theory · Mathematics 2010-10-22 Florentina Bunea , Alexandre B. Tsybakov , Marten H. Wegkamp , Adrian Barbu

In this paper, we propose a maximum smoothed likelihood method to estimate the component density functions of mixture models, in which the mixing proportions are known and may differ among observations. The proposed estimates maximize a…

Methodology · Statistics 2014-07-14 Tao Yu , Pengfei Li , Jing Qin

It is well known that the minimax rates of convergence of nonparametric density and regression function estimation of a random variable measured with error is much slower than the rate in the error free case. Surprisingly, we show that if…

Statistics Theory · Mathematics 2019-08-21 Fei Jiang , Yanyuan Ma , Raymond J. Carroll

We consider testing statistical hypotheses about densities of signals in deconvolution models. A new approach to this problem is proposed. We constructed score tests for the deconvolution with the known noise density and efficient score…

Statistics Theory · Mathematics 2013-12-02 Mikhail Langovoy

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel…

Machine Learning · Computer Science 2011-11-24 Francis Bach , Rodolphe Jenatton , Julien Mairal , Guillaume Obozinski

Approximate Deconvolution (AD) has emerged as a promising closure for Large-Eddy Simulation (LES) in complex multi-physics flows, where the conventional pure Dynamic Eddy-Viscosity (DEV) models experience issues. In this research, we…

Fluid Dynamics · Physics 2025-11-14 Ehsan Amani , Mohammad Bagher Molaei , Morteza Ghorbani

Recent advances have demonstrated the possibility of solving the deconvolution problem without prior knowledge of the noise distribution. In this paper, we study the repeated measurements model, where information is derived from multiple…

Statistics Theory · Mathematics 2024-09-04 Jérémie Capitao-Miniconi , Elisabeth Gassiat , Luc Lehéricy

In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the…

Information Theory · Computer Science 2018-04-17 Wen Huang , Paul Hand