A Fast Gradient Approximation for Nonlinear Blind Signal Processing
Other authors
Publication date
2013ISSN
1866-9956
Abstract
When dealing with nonlinear blind processing algorithms (deconvolution or post-nonlinear source separation), complex mathematical estimations must be done giving as a result very slow algorithms. This is the case, for example, in speech processing, spike signals deconvolution or microarray data analysis. In this paper, we propose a simple method to reduce computational time for the inversion of Wiener systems or the separation of post-nonlinear mixtures, by using a linear approximation in a minimum mutual information algorithm. Simulation results demonstrate that linear spline interpolation is fast and accurate, obtaining very good results (similar to those obtained without approximation) while computational time is dramatically decreased. On the other hand, cubic spline interpolation also obtains similar good results, but due to its intrinsic complexity, the global algorithm is much more slow and hence not useful for our purpose.
Document Type
Article
Language
English
Keywords
Tractament del senyal
Pages
15 p.
Publisher
Springer
Citation
Solé-Casals, Jordi ; Caiafa, Cesar F. "A Fast Gradient Approximation for Nonlinear Blind Signal Processing" A: Cognitive Computation, 5(4) 483-492
This item appears in the following Collection(s)
- Articles [1389]
Rights
(c) Springer (The original publication is available at www.springerlink.com)
Tots els drets reservats