Research
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

36912 · May 202619922001200920172026
48 results for blind deblurring

Blind image deblurring remains a topic of enduring interest. Learning based approaches, especially those that employ neural networks have emerged to complement traditional model based methods and in many cases achieve vastly enhanced performance. That said, neural network approaches are generally empirically designed a…

2019-02-09abs ↗pdf ↗

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.

While neural networks have achieved vastly enhanced performance over traditional iterative methods in many cases, they are generally empirically designed and the underlying structures are difficult to interpret. The algorithm unrolling approach has helped connect iterative algorithms to neural network architectures. Ho…

2019-02-09abs ↗pdf ↗

Physen-Noise2Noise tackles defocus deblurring in low-light conditions with physics-guided self-supervised learning.

problem Defocus deblurring in low-light conditions with complex biased noise.
method Physics-guided self-supervised deblurring framework that leverages noisy multi-frame observations and a learnable noise bias parameter.
result Physen-Noise2Noise consistently outperforms state-of-the-art methods in defocus deblurring with complex biased noise.

Novel algorithm accelerates PnP methods for image deblurring and super-resolution.

problem Efficiently solving inverse problems and imaging with provable convergence guarantees.
method Incorporates quasi-Newton steps into provable PnP framework based on proximal denoisers.
result 2--8x faster convergence compared to other provable PnP methods with similar quality.

New method uses deep learning to solve linear inverse problems.

problem Solving linear inverse problems with high-dimensional signals.
method Stochastic coarse-to-fine gradient ascent procedure using implicit prior from denoising CNN.
result General algorithm for solving linear inverse problems without additional training.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

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 …

2012-03-21abs ↗pdf ↗

New insights into learning for blind inverse problems with theoretical guarantees.

problem Learning in blind inverse problems where both signal and operator are unknown.
method Data-driven approaches using Linear Minimum Mean Square Estimators (LMMSEs) with theoretical analysis.
result Established equivalences with Tikhonov-regularized formulations and derived finite-sample error bounds.

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…

2018-03-21abs ↗pdf ↗

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

A framework to quantify deployment risk in ML systems, especially for rare states.

problem Under-supported rare states in ML models lead to unreliable performance in unseen data.
method Blind-Spot Mass (B_n(tau)) using Good-Turing unseen-species estimation.
result Identifies and quantifies the risk of under-supported states in ML models.

Agents trained in simulation may make errors in the real world due to mismatches between training and execution environments. These mistakes can be dangerous and difficult to discover because the agent cannot predict them a priori. We propose using oracle feedback to learn a predictive model of these blind spots to red…

2018-05-23abs ↗pdf ↗

CNNs can develop blind spots due to uneven padding in feature maps.

problem Spatial bias in convolutional networks leads to blind spots in certain tasks.
method Identified and analyzed the role of padding in convolutional networks, proposing solutions to mitigate bias.
result Mitigating spatial bias improves model accuracy, especially in tasks like small object detection.

The paper studies sparsity in EBF with hyperpriors and proposes a PALM algorithm.

problem Promoting sparsity in sparse learning problems.
method Empirical Bayes framework, hyperpriors, proximal alternating linearized minimization (PALM) algorithm.
result Appropriate hyperpriors can significantly enhance sparsity and restoration accuracy.

A fast method approximates likelihood scores for noisy linear inverse problems.

problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.

The adversarial training procedure proposed by Madry et al. (2018) is one of the most effective methods to defend against adversarial examples in deep neural networks (DNNs). In our paper, we shed some lights on the practicality and the hardness of adversarial training by showing that the effectiveness (robustness on t…

2019-01-15abs ↗pdf ↗

Unified framework for fair classification with group-blindness/awareness guarantees.

problem Challenges in enforcing fairness and group-blindness in binary classification.
method Unified framework based on post-processing procedure, applicable to various group fairness notions.
result Minimax rate-optimality of the proposed algorithm with controlled excess risk.

A new method for separating mixed signals in space and time.

problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.

Self-supervised method predicts clean signal and noise distribution from noisy images.

problem Blind denoising and noise estimation in biomedical images with limited clean data.
method Two neural networks jointly predict clean signal and noise distribution from noisy observations.
result Significantly outperforms state-of-the-art algorithms on six biomedical image datasets.

GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.

problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.

AR-Flow VAE improves blind source separation with flexible autoregressive priors.

problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.

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…

2018-06-01abs ↗pdf ↗

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…

2018-09-18abs ↗pdf ↗

Improved image restoration using frequency-guided sampling.

problem Restoring high-quality images from degraded observations with known degradation processes.
method Proposed a frequency-guided sampling approach for diffusion-based image restoration, incorporating a time-varying low-pass filter.
result Significantly improved performance on challenging image restoration tasks, including motion deblurring and image dehazing.

We propose a new blind source separation algorithm based on mixtures of alpha-stable distributions. Complex symmetric alpha-stable distributions have been recently showed to better model audio signals in the time-frequency domain than classical Gaussian distributions thanks to their larger dynamic range. However, infer…

2017-11-13abs ↗pdf ↗

The rising interest in pattern recognition and data analytics has spurred the development of innovative machine learning algorithms and tools. However, as each algorithm has its strengths and limitations, one is motivated to judiciously fuse multiple algorithms in order to find the "best" performing one, for a given da…

2017-12-08abs ↗pdf ↗

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

This letter proposes a dictionary learning algorithm for blind one bit compressed sensing. In the blind one bit compressed sensing framework, the original signal to be reconstructed from one bit linear random measurements is sparse in an unknown domain. In this context, the multiplication of measurement matrix $\Ab$ an…

2015-08-30abs ↗pdf ↗

DPMC improves inverse problem solving with MCMC, reducing error in noisy conditions.

problem Inaccurate posterior approximation in inverse problems with high noise levels.
method DPMC uses Annealed MCMC to sample through a series of intermediate distributions, reducing accumulated error.
result DPMC outperforms DPS in various inverse problems, reducing error and evaluations.

Paper proposes a time-frequency analysis method for blind modulation classification in MIMO systems.

problem Blind modulation classification in MIMO systems with overlapping signals and unknown channel parameters.
method Time-frequency analysis using windowed short-time Fourier transform, conversion to RGB spectrogram images, convolutional neural network for classification, decision fusion.
result Proposed scheme achieves high classification accuracy at different SNRs, outperforming existing methods.