A Semi-blind Complex ICA Algorithm for Extracting a Desired Signal Based on Kurtosis Maximization
ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II
Complex-valued neural networks: the merits and their origins
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
IEEE Transactions on Neural Networks
Complex independent component analysis by entropy bound minimization
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Recent progress in applications of complex-valued neural networks
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Constrained complex-valued ICA without permutation ambiguity based on negentropy maximization
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
| Hi-index | 0.00 |
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost function satisfies the Brandwood's independent analyticity condition. In particular, this technique has been used to derive three algorithms, namely, kurtosis maximization using gradient update (KM-G), kurtosis maximization using fixed-point update (KM-F), and kurtosis maximization using Newton update (KM-N), to perform the complex independent component analysis (ICA) based on the maximization of the complex kurtosis cost function. The derivation and related analysis of the three algorithms are performed in the complex domain without using any complex-real mapping for differentiation and optimization. A general complex Newton rule is also derived for developing the KM-N algorithm. The real conjugate gradient algorithm is extended to the complex domain similar to the derivation of complex Newton rule. The simulation results indicate that the fixed-point version (KM-F) and gradient version (KM-G) are superior to other similar algorithms when the sources include both circular and noncircular distributions and the dimension is relatively high.