Using generic order moments for separation of dependent sources with linear conditional expectations

In this work, we approach the blind separation of dependent sources based only on a set oftheirlinearmixtures. We prove that, when the sources have a pairwise dependence characterized by the linear conditional expectation (LCE) law, i.e. E[Si|Sj]=?ijSj for i = j, with ?ij=E[SiSj](correlation coefficient), we are able to separate them by maximizing or minimizing a Generic Order Moment (GOM) of their mixture defined by ?p=E[|?1S1+?2S2|^p]. This general measure includes the higher order as well as the fractional moment cases. Our results, not only confirm some of the existing results for the independent sources case but also they allow us to explore new objective functions for Dependent Component Analysis. A set of examples illustrating the consequences of our theory is presented. Also, a comparison of our GOM based algorithm, the classical FAST ICA and a very recently proposed algorithm for dependent sources, the Bounded Component Analysis (BCA) algorithm, is shown.