A fast gradient approximation for nonlinear blind signal processing
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 analy...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/4091 |
| Acesso em linha: | http://hdl.handle.net/11336/4091 |
| Access Level: | acceso abierto |
| Palavra-chave: | Blind Deconvolution Blind Source Separation Minimum Mutual Information Methods Wiener Systems https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Resumo: | 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 intrinsically complexity the global algorithm is much more slow and hence not useful for our purpose. |
|---|