One-Bit-Matching Conjecture for Independent Component Analysis
Neural Computation
One-Bit-Matching ICA theorem, convex-concave programming, and combinatorial optimization
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Global convergence of FastICA: theoretical analysis and practical considerations
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
Fast and robust fixed-point algorithms for independent component analysis
IEEE Transactions on Neural Networks
Monotonic convergence of fixed-point algorithms for ICA
IEEE Transactions on Neural Networks
Self-adaptive blind source separation based on activation functions adaptation
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
The local stability analysis of maximum nongaussianity estimation (MNE) is investigated for nonquadratic functions in independent component analysis (ICA). Using trigonometric function, we first derive the local stability condition of MNE for nonquadratic functions without any approximation as has been made in previous literatures. The research shows that the condition is essentially the generalization of Xu’s one-bit-matching ICA theorem in MNE. Secondly, based on the generalized Gaussian model (GGM), the availability of local stability condition and robustness to outliers are addressed for three typical nonquadratic functions for various distributed independent components.