Artículos de revistas
The modified MEXICO for ICA over finite fields
Registro en:
Signal Processing. Elsevier Science Bv, v. 93, n. 9, n. 2525, n. 2528, 2013.
0165-1684
WOS:000320347600015
10.1016/j.sigpro.2013.03.021
Autor
Silva, DG
Nadalin, EZ
Montalvao, J
Attux, R
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) In 2007, a theory of ICA over finite fields emerged and an algorithm based on pairwise comparison of mixtures, called MEXICO, was developed to deal with this new problem. In this letter, we propose improvements in the method that, according to simulations in GF(2) and GF(3) scenarios, lead to a faster convergence and better separation results, increasing the application possibilities of the new theory in the context of large databases. (c) 2013 Elsevier B.V. All rights reserved. 93 9 2525 2528 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)