English
Related papers

Related papers: Structured Local Optima in Sparse Blind Deconvolut…

200 papers

We investigate the problem of reconstructing signals from a subsampled convolution of their modulated versions and a known filter. The problem is studied as applies to specific imaging systems relying on spatial phase modulation by randomly…

Information Theory · Computer Science 2016-03-23 Sohail Bahmani , Justin Romberg

Key to successfully deal with complex contemporary datasets is the development of tractable models that account for the irregular structure of the information at hand. This paper provides a comprehensive and unifying view of several…

Signal Processing · Electrical Eng. & Systems 2021-06-04 David Ramírez , Antonio G. Marques , Santiago Segarra

Many real world practical problems can be formulated as $\ell_{0}$-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative signals to underdetermined linear systems. They have been widely applied in signal…

Optimization and Control · Mathematics 2017-08-29 Angang Cui , Haiyang Li , Meng Wen , Jigen Peng

We propose a method to reconstruct sparse signals degraded by a nonlinear distortion and acquired at a limited sampling rate. Our method formulates the reconstruction problem as a nonconvex minimization of the sum of a data fitting term and…

Optimization and Control · Mathematics 2023-01-19 Arthur Marmin , Marc Castella , Jean-Christophe Pesquet , Laurent Duval

The blind deconvolution problem seeks to recover a pair of vectors from a set of rank one bilinear measurements. We consider a natural nonsmooth formulation of the problem and show that under standard statistical assumptions, its moduli of…

Optimization and Control · Mathematics 2019-01-21 Vasileios Charisopoulos , Damek Davis , Mateo Díaz , Dmitriy Drusvyatskiy

We analyze the statistical problem of recovering an atomic signal, modeled as a discrete uniform distribution $\mu$, from a binned Poisson convolution model. This question is motivated, among others, by super-resolution laser microscopy…

Statistics Theory · Mathematics 2025-08-04 Shayan Hundrieser , Tudor Manole , Danila Litskevich , Axel Munk

We study sparse spikes deconvolution over the space of Radon measures on $\mathbb{R}$ or $\mathbb{T}$ when the input measure is a finite sum of positive Dirac masses using the BLASSO convex program. We focus on the recovery properties of…

Information Theory · Computer Science 2016-09-01 Quentin Denoyelle , Vincent Duval , Gabriel Peyré

The blind deconvolution problem aims to recover a rank-one matrix from a set of rank-one linear measurements. Recently, Charisopulos et al. introduced a nonconvex nonsmooth formulation that can be used, in combination with an initialization…

Optimization and Control · Mathematics 2019-11-21 Mateo Díaz

We consider the multichannel blind deconvolution problem where we observe the output of multiple channels that are all excited with the same unknown input. From these observations, we wish to estimate the impulse responses of each of the…

Numerical Analysis · Mathematics 2017-10-04 Kiryung Lee , Ning Tian , Justin Romberg

We propose a method for MIMO decoding when channel state information (CSI) is unknown to both the transmitter and receiver. The proposed method requires some structure in the transmitted signal for the decoding to be effective, in…

Signal Processing · Electrical Eng. & Systems 2018-02-06 Thomas R. Dean , Mary Wootters , Andrea J. Goldsmith

A fruitful approach for solving signal deconvolution problems consists of resorting to a frame-based convex variational formulation. In this context, parallel proximal algorithms and related alternating direction methods of multipliers have…

Other Computer Science · Computer Science 2015-05-28 Nelly Pustelnik , Jean-Christophe Pesquet , Caroline Chaux

Low-rank matrix recovery from structured measurements has been a topic of intense study in the last decade and many important problems like matrix completion and blind deconvolution have been formulated in this framework. An important…

Information Theory · Computer Science 2020-04-13 Felix Krahmer , Dominik Stöger

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

We propose a new solver for the sparse spikes deconvolution problem over the space of Radon measures. A common approach to off-the-grid deconvolution considers semidefinite (SDP) relaxations of the total variation (the total mass of the…

Optimization and Control · Mathematics 2019-03-12 Paul Catala , Vincent Duval , Gabriel Peyré

We propose a learned-structured unfolding neural network for the problem of compressive sparse multichannel blind-deconvolution. In this problem, each channel's measurements are given as convolution of a common source signal and sparse…

Signal Processing · Electrical Eng. & Systems 2021-02-15 Bahareh Tolooshams , Satish Mulleti , Demba Ba , Yonina C. Eldar

In the study of condensed matter physics, spectral information plays an important role for understand the mechanism of materials. However, it is difficult to obtain the spectrum directly through experiments or simulation. For example, the…

Computational Physics · Physics 2022-12-23 Haidong Xie , Xueshuang Xiang , Yuanqing Chen

We adress the problem of Laplace deconvolution with random noise in a regression framework. The time set is not considered to be fixed, but grows with the number of observation points. Moreover, the convolution kernel is unknown, and…

Statistics Theory · Mathematics 2013-04-05 Thomas Vareschi

We present a rotation-equivariant unsupervised learning framework for the sparse deconvolution of non-negative scalar fields defined on the unit sphere. Spherical signals with multiple peaks naturally arise in Diffusion MRI (dMRI), where…

Image and Video Processing · Electrical Eng. & Systems 2021-02-19 Axel Elaldi , Neel Dey , Heejong Kim , Guido Gerig

Minimizing a convex function of a measure with a sparsity-inducing penalty is a typical problem arising, e.g., in sparse spikes deconvolution or two-layer neural networks training. We show that this problem can be solved by discretizing the…

Optimization and Control · Mathematics 2020-11-04 Lenaic Chizat

Defocus blur is a physical consequence of the optical sensors used in most cameras. Although it can be used as a photographic style, it is commonly viewed as an image degradation modeled as the convolution of a sharp image with a…

Computer Vision and Pattern Recognition · Computer Science 2022-06-28 Ali Karaali , Claudio Rosito Jung
‹ Prev 1 3 4 5 6 7 10 Next ›