We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to adversarial attacks to assessing and describing failure modes of algorithms in missi…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “blind deconvolution”
Variational Semi-blind Sparse Deconvolution with Orthogonal Kernel Bases and its Application to MRFMphysics.data-an
We present a variational Bayesian method of joint image reconstruction and point spread function (PSF) estimation when the PSF of the imaging device is only partially known. To solve this semi-blind deconvolution problem, prior distributions are specified for the PSF and the 3D image. Joint image reconstruction and PSF…
Deconvolution microscopy has been extensively used to improve the resolution of the widefield fluorescent microscopy. Conventional approaches, which usually require the point spread function (PSF) measurement or blind estimation, are however computationally expensive. Recently, CNN based approaches have been explored a…
New algorithm for tensor decomposition and Gaussian mixture models.
problem Efficiently decompose overcomplete order-3 tensors and estimate parameters of Gaussian mixtures.
method Proposes Jennrich's algorithm adapted for tensor decomposition and Gaussian mixture models.
result Efficient algorithm for decomposing symmetric overcomplete order-3 tensors and estimating parameters of Gaussian mixtures.
Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem, where the one unknown signal is short and the other one is sparsely and randomly sup…
Two-stage nonconvex algorithm and convex relaxation both achieve optimal accuracy in noisy blind deconvolution.
problem Solving bilinear systems of equations with random noise under different designs.
method Two-stage nonconvex algorithm and convex relaxation.
result Both methods achieve minimax-optimal accuracy in the presence of random noise.
We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike …
A new method for accurately reconstructing signals without knowing the kernel or signal regularity.
problem Recovering signals from noisy measurements without prior knowledge of the convolution kernel or signal regularity.
method Parametrizing the convolution kernel and prior length-scales, jointly estimated in the inversion procedure.
result Accurate reconstructions of signals with varying regularity and unknown kernel size.
We introduce the blind subspace deconvolution (BSSD) problem, which is the extension of both the blind source deconvolution (BSD) and the independent subspace analysis (ISA) tasks. We examine the case of the undercomplete BSSD (uBSSD). Applying temporal concatenation we reduce this problem to ISA. The associated `high …
Beurling-Selberg Extremization for Dual-Blind Deconvolution Recovery in Joint Radar-Communicationscs.IT
Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.
problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.
A novel Gaussian process approach for deconvolution of missing data signals.
problem Recovering a latent source from observations with missing parts and unknown filters.
method Gaussian process prior for Bayesian nonparametric deconvolution.
result The proposed Gaussian process deconvolution (GPDC) method is feasible and effective.
New method recovers radar and communication signals from overlaid data.
problem Recover radar and communication signals from overlaid data with unknown parameters.
method Propose minimizing the sum of multivariate atomic norms (SoMAN) for multi-antenna receiver.
result Minimum number of samples and antennas required for perfect recovery is logarithmically dependent on the maximum of radar targets and communications paths.
We study the multi-channel sparse blind deconvolution (MCS-BD) problem, whose task is to simultaneously recover a kernel and multiple sparse inputs from their circulant convolution (). We formulate the task as a nonco…
Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficientlystat.ML
Multi-channel sparse blind deconvolution, or convolutional sparse coding, refers to the problem of learning an unknown filter by observing its circulant convolutions with multiple input signals that are sparse. This problem finds numerous applications in signal processing, computer vision, and inverse problems. However…
Blind deconvolution involves the estimation of a sharp signal or image given only a blurry observation. Because this problem is fundamentally ill-posed, strong priors on both the sharp image and blur kernel are required to regularize the solution space. While this naturally leads to a standard MAP estimation framework,…
A new method for joint noise removal and trend estimation from sparse signals.
problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.
Paper tackles image recovery from blurry measurements using deep generative priors.
problem Jointly recovering two real-valued signals from phaseless circular convolutions.
method Alternating gradient descent algorithm with deep generative priors.
result Reconstructs quality images from blurry measurements.
We consider the problem of demixing a sequence of source signals from the sum of noisy bilinear measurements. It is a generalized mathematical model for blind demixing with blind deconvolution, which is prevalent across the areas of dictionary learning, image processing, and communications. However, state-of- the-art c…
Estimation of response functions is an important task in dynamic medical imaging. This task arises for example in dynamic renal scintigraphy, where impulse response or retention functions are estimated, or in functional magnetic resonance imaging where hemodynamic response functions are required. These functions can no…
Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, state-of-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order…
Method leverages population data to deconvolve unknown noise and model parameters.
problem Deconvolution of unknown observational noise in distributional inversion problems.
method Large data sets from physical systems, modified gradient descent, active learning.
result Simultaneous deconvolution of noise and model parameters.
The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning, sparse blind deconvolution, and many other problems in signal processing and machine …
Deconvolutional layers have been widely used in a variety of deep models for up-sampling, including encoder-decoder networks for semantic segmentation and deep generative models for unsupervised learning. One of the key limitations of deconvolutional operations is that they result in the so-called checkerboard problem.…
Integrating Bayesian Spectral Deconvolution and Expert Scientific Reasoning for Robust Peak Estimationphysics.data-an
Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.
problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.
Improved subgradient method tackles ill-conditioned composite optimization problems.
problem Slow convergence of subgradient method for composite optimization problems.
method Preconditioned subgradient method with Levenberg-Marquardt approach.
result Linear convergence rate for composite optimization problems under mild conditions.
Hybrid method reveals true currency correlations.
problem Identify currency status in foreign exchange networks.
method Combines DCCC and network deconvolution to filter indirect effects.
result Reflects currency status changes and is more stable.
In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators, resulting in rather …
Normalizing flows improve density estimation from noisy data.
problem Estimating underlying density from noisy samples.
method Use normalizing flows for density estimation with arbitrary noise distributions, using amortized variational inference.
result Normalizing flows can outperform Gaussian mixtures for density deconvolution.
Deconvolution of large survey images with millions of galaxies requires to develop a new generation of methods which can take into account a space variant Point Spread Function (PSF) and have to be at the same time accurate and fast. We investigate in this paper how Deep Learning (DL) could be used to perform this task…
Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization. While conventional wisdom often takes a dim view of nonconvex optimization algorithms due to their susceptibility to spurious local minima, simple iterative …
Convolution is a central operation in Convolutional Neural Networks (CNNs), which applies a kernel to overlapping regions shifted across the image. However, because of the strong correlations in real-world image data, convolutional kernels are in effect re-learning redundant data. In this work, we show that this redund…
A distributed subgradient method tackles non-convex optimization problems in networks.
problem Solving non-convex optimization problems in distributed networks.
method Proposes a distributed stochastic subgradient method (stoDPSM) with theoretical guarantees.
result Global convergence of stoDPSM using Moreau envelope stationarity measure, and linear convergence under sharpness condition.
Stochastic volatility modelling of financial processes has become increasingly popular. The proposed models usually contain a stationary volatility process. We will motivate and review several nonparametric methods for estimation of the density of the volatility process. Both models based on discretely sampled continuo…
OmniFold uses deep learning to deconvolve high-dimensional simulations.
problem Removing detector distortions and accounting for noise processes in high-dimensional simulations.
method OmniFold is a deep learning-based approach for maximum likelihood deconvolution.
result OmniFold can remove detector distortions and account for noise processes and acceptance effects.
Blind Descent avoids gradient issues, using a different learning approach.
problem Gradient issues like exploding and vanishing gradients.
method Does not use gradients to guide learning; instead, it is a more fundamental learning process.
result Gradient descent is a specific case of Blind Descent.
This paper develops a new method for online density estimation from noisy data.
problem Estimating probability density function from noisy streaming data.
method Quasi-Bayesian sequential deconvolution using Newton's algorithm.
result Sequential deconvolution estimate with large sample asymptotic guarantees.
New algorithm profiles nuisance parameters for multidimensional deconvolution.
problem Statistical removal of instrumental effects in experimental measurements.
method Iterative algorithm called Profile OmniFold that profiles nuisance parameters.
result Illustrated with a Gaussian example, highlighting promising capabilities.
Nonparametric density deconvolution and denoising using simulation-based inference
problem Learning latent signals and their distributions in the presence of measurement noise
method Convolutional maximum mean discrepancy (convMMD) loss and likelihood-free framework
result Learn a latent generative model matching observed data distribution
A generative Bayesian model is developed for deep (multi-layer) convolutional dictionary learning. A novel probabilistic pooling operation is integrated into the deep model, yielding efficient bottom-up and top-down probabilistic learning. After learning the deep convolutional dictionary, testing is implemented via dec…
The Extreme Deconvolution method fits a probability density to a dataset where each observation has Gaussian noise added with a known sample-specific covariance, originally intended for use with astronomical datasets. The existing fitting method is batch EM, which would not normally be applied to large datasets such as…
DDN models flexible free-form conditional distributions.
problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.
New divergences improve score-based methods for multi-modal distributions.
problem Blindness problem in score-based divergences for multi-modal distributions.
method Proposed a new family of divergences to mitigate blindness.
result Improved performance in density estimation compared to traditional approaches.
New method solves blind inverse problems by optimizing both operator and image parameters.
problem Solving blind inverse problems with known forward operator.
method Parallel reverse diffusion guided by gradients from intermediate stages.
result State-of-the-art performance on blind deblurring and imaging through turbulence.
Single-channel signal separation and deconvolution aims to separate and deconvolve individual sources from a single-channel mixture and is a challenging problem in which no prior knowledge of the mixing filters is available. Both individual sources and mixing filters need to be estimated. In addition, a mixture may con…
Study characterizes spike deconvolution basin for noisy data.
problem Recover spike locations from noisy convolution with PSF across multiple snapshots.
method Variable-projection formulation, explicit basin of convexity characterization, local convergence guarantees.
result Consistent estimator within basin of convexity under stochastic noise, complementary error bound under adversarial noise.
Local minimax analysis for Poisson deconvolution of discrete signals.
problem Estimating a discrete uniform signal from Poisson convolutions.
method Local minimax risk analysis of a broad class of kernels.
result Sharp estimation rates as a function of signal clustering.
Image super-resolution is a challenging task and has attracted increasing attention in research and industrial communities. In this paper, we propose a novel end-to-end Attention-based DenseNet with Residual Deconvolution named as ADRD. In our ADRD, a weighted dense block, in which the current layer receives weighted f…
Tissue heterogeneity is a major confounding factor in studying individual populations that cannot be resolved directly by global profiling. Experimental solutions to mitigate tissue heterogeneity are expensive, time consuming, inapplicable to existing data, and may alter the original gene expression patterns. Here we a…