![]() |
CiteULike | ![]() |
bigga's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Fast algorithms for mutual information based independent component analysisby: Dinh-Tuan Pham
Signal Processing, IEEE Transactions on In Signal Processing, IEEE Transactions on, Vol. 52, No. 10. (2004), pp. 2690-2700.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis paper provides fast algorithms to perform independent component analysis based on the mutual information criterion. The main ingredient is the binning technique and the use of cardinal splines, which allows the fast computation of the density estimator over a regular grid. Using a discretized form of the entropy, the criterion can be evaluated quickly together with its gradient, which can be expressed in terms of the score functions. Both offline and online separation algorithms have been developed. Our density, entropy, and score estimators also have their own interest.
BibTeX record
RIS record