A simple approximation for fast nonlinear deconvolution
When dealing with nonlinear blind deconvolution, complex mathematical estimations must be done giving as a result very slow algorithms. This is the case, for example, in speech processing or in microarray data analysis. In this paper we propose a simple method to reduce computational time for the in...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/5208 |
| Acceso en línea: | http://hdl.handle.net/11336/5208 |
| Access Level: | acceso abierto |
| Palabra clave: | Blind Deconvolution Speech Processing https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
| Sumario: | When dealing with nonlinear blind deconvolution, complex mathematical estimations must be done giving as a result very slow algorithms. This is the case, for example, in speech processing or in microarray data analysis. In this paper we propose a simple method to reduce computational time for the inversion of Wiener systems by using a linear approximation in a minimum-mutual information algorithm. Experimental 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. |
|---|