One-Bit-Matching Conjecture for Independent Component Analysis

DOI10.1162/089976604322742074MaRDI QIDQ4819830zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Kai-Chun Chiu, Zhi-Yong Liu, Lei Xu

Publication date 5 October 2004

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976604322742074

zbMATH Keywords

kurtosisskewness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Further Result on the ICA One-Bit-Matching Conjecture
• Independent Component Analysis and Blind Signal Separation
• One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
• Advances in Neural Networks – ISNN 2005
• Independent Component Analysis and Blind Signal Separation

Cites work

• A Constrained EM Algorithm for Independent Component Analysis
• HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION
• Independent component analysis, a new concept?
• Learned parametric mixture based ICA algorithm

Cited in

(8)

• Investigation on the skewness for independent component analysis
• One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
• Advances in Neural Networks – ISNN 2005
• Independent Component Analysis and Blind Signal Separation
• Applications for affine invariant descriptor and affine parameter estimation based on two-source ICA
• A Further Result on the ICA One-Bit-Matching Conjecture
• Independent Component Analysis and Blind Signal Separation
• Fast nonlinear autocorrelation algorithm for source separation

This page was built for publication: One-Bit-Matching Conjecture for Independent Component Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819830)