On Deconvolution Problems: Numerical Aspects
نویسندگان
چکیده
An optimal algorithm is described for solving the deconvolution problem of the form ku := ∫ t 0 k(t − s)u(s)ds = f(t) given the noisy data fδ, ||f − fδ|| ≤ δ. The idea of the method consists of the representation k = A(I+S), where S is a compact operator, I + S is injective, I is the identity operator, A is not boundedly invertible, and an optimal regularizer is constructed for A. The optimal regularizer is constructed using the results of the paper MR 40#5130.
منابع مشابه
Regularization Methods for Blind Deconvolution and Blind Source Separation Problems
This paper is devoted to blind deconvolution and blind separation problems. Blind deconvolution is the identiication of a point spread function and an input signal from an observation of their convolution. Blind source separation is the recovery of a vector of input signals from a vector of observed signals, which are mixed by a linear (unknown) operator. We show that both problems are paradigm...
متن کاملLow-rank spectral optimization
Various applications in signal processing and machine learning give rise to highly structured spectral optimization problems characterized by low-rank solutions. Two important examples that motivate this work are optimization problems from phase retrieval and from blind deconvolution, which are designed to yield rank-1 solutions. An algorithm is described based on solving a certain constrained ...
متن کاملControlled Total Variation regularization for inverse problems
This paper provides a new algorithm for solving inverse problems, based on the minimization of the L2 norm and on the control of the Total Variation. It consists in relaxing the role of the Total Variation in the classical Total Variation minimization approach, which permits us to get better approximation to the inverse problems. The numerical results on the deconvolution problem show that our ...
متن کاملDeconvolution of linear systems with quantized input: an information theoretic viewpoint
In spite of the huge literature on deconvolution problems, very little is done for hybrid contexts where signals are quantized. In this paper we undertake an information theoretic approach to the deconvolution problem of a simple integrator with quantized binary input and sampled noisy output. We recast it into a decoding problem and we propose and analyze (theoretically and numerically) some l...
متن کاملLow-Rank Spectral Optimization via Gauge Duality
Various applications in signal processing and machine learning give rise to highly structured spectral optimization problems characterized by low-rank solutions. Two important examples that motivate this work are optimization problems from phase retrieval and from blind deconvolution, which are designed to yield rank-1 solutions. An algorithm is described that is based on solving a certain cons...
متن کامل