Blind Deconvolution of Timely Correlated Sources by Gradient Descent Search
نویسنده
چکیده
In multichannel blind deconvolution (MBD) the goal is to calculate possibly scaled and delayed estimates of source signals from their convoluted mixtures, using approximate knowledge of the source characteristics only. Nearly all of the solutions to MBD proposed so far require from source signals to be pair-wise statistically independent and to be timely not correlated. In practice, this can only be satisfied by specific synthetic signals. In this paper we describe how to modify gradient-based iterative algorithms in order to perform the MBD task on timely correlated sources. Implementation issues are discussed and specific tests on synthetic and real 2-D images are documented.
منابع مشابه
Blind Deconvolution of Timely-correlated Sources by Homomorphic Filtering in Fourier Space
An approach to multi-channel blind deconvolution is developed, which uses an adaptive filter that performs blind source separation in the Fourier space. The approach keeps (during the learning process) the same permutation and provides appropriate scaling of components for all frequency bins in the frequency space. Experiments verify a proper blind deconvolution of convolution mixtures of sources.
متن کاملMultichannel Blind Deconvolution Using a Generalized Exponential Source Model
In this paper, we present an algorithm for the problem of multi-channel blind deconvolution which can adapt to unknown sources with both sub-Gaussian and super-Gaussian probability density distributions using a generalized exponential source model. We use a state space representation to model the mixer and demixer respectively, and show how the parameters of the demixer can be adapted using a g...
متن کاملBlind Deconvolution of Sources in Fourier Space Based on Generalized Laplace Distribution
An approach to multi-channel blind deconvolution is developed, which uses an adaptive filter that performs blind source separation in the Fourier space. The approach keeps (during the learning process) the same permutation and provides appropriate scaling of components for all frequency bins in the frequency space. Experiments indicate that Generalized Laplace Distribution can be used effective...
متن کاملGradient-Based Blind Deconvolution with Flexible Approximated Bayesian Estimator
In this paper a new blind deconvolution algorithm as modzjkation of the Bellini ‘s ‘Bussgang ’ is presented. Firstly, a novel version based on stochastic Gradient Steepest Descent error minimization technique isproposed. Then the Bayesian estimator used by Bellini is approximated with a flexible Sigmoid’ parameterized with adjustable amplitude and slope, and a gradient-based technique is propos...
متن کاملImplicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion and Blind Deconvolution
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, stateof-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order to guarantee fast convergence. For vanilla procedures such as gradient descen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003