A Further Result on the ICA One-Bit-Matching Conjecture
From MaRDI portal
Publication:5696501
DOI10.1162/0899766053011483zbMATH Open1093.68085OpenAlexW2097814764WikidataQ123244780 ScholiaQ123244780MaRDI QIDQ5696501FDOQ5696501
Authors: Jinwen Ma, Zhi-Yong Liu, Lei Xu
Publication date: 18 October 2005
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/0899766053011483
Recommendations
- Advances in Neural Networks – ISNN 2005
- One-Bit-Matching Conjecture for Independent Component Analysis
- Independent Component Analysis and Blind Signal Separation
- One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
- Independent Component Analysis and Blind Signal Separation
- On the Convergence of ICA Algorithms With Symmetric Orthogonalization
- ICA based algorithms for computing optimal 1-D linear block transforms in variable high-rate source coding
- On fast decoding of high-dimensional signals from one-bit measurements
Cites Work
Cited In (5)
- One-Bit-Matching Conjecture 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
- Independent Component Analysis and Blind Signal Separation
This page was built for publication: A Further Result on the ICA One-Bit-Matching Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696501)