Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/742
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Acharya, D P | - |
dc.contributor.author | Panda, G | - |
dc.contributor.author | Mishra, S | - |
dc.contributor.author | Lakshmi, Y V S | - |
dc.date.accessioned | 2008-11-13T06:29:48Z | - |
dc.date.available | 2008-11-13T06:29:48Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | International Conference on Conference on Computational Intelligence and Multimedia Applications, 2007, 13-15 Dec. 2007 Sivakasi, Tamil Nadu, P 527 - 531 | en |
dc.identifier.uri | http://dx.doi.org/10.1109/ICCIMA.2007.126 | - |
dc.identifier.uri | http://hdl.handle.net/2080/742 | - |
dc.description | Copyright for the paper belongs IEEE | en |
dc.description.abstract | The present paper proposes a bacteria foraging optimization based independent component analysis (BFOICA) algorithm assuming a linear noise free model. It is observed that the proposed BFOICA algorithm overcomes the long standing permutation ambiguity and recovers the independent components(IC) in a fixed order which depends on the statistical characteristics of the signals to be estimated. The paper compares the performance of BFOICA algorithm with the constrained genetic algorithm based ICA (CGAICA) and most popular fast ICA algorithm. The proposed algorithm offers comparable or even better performance compared to fast ICA algorithm and faster convergence and better mean square error performance compared to CGAICA. | en |
dc.format.extent | 331743 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE | en |
dc.subject | genetic algorithms | en |
dc.subject | independent component analysis | en |
dc.subject | mean square error methods | en |
dc.subject | signal processing | en |
dc.title | Bacteria Foraging Based Independent Component Analysis | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.