A method based on L-BFGS to solve constrained complex-valued ICA
Complex-valued independent component analysis (ICA) is a celebrated method in blind separation of complex-valued signals. In this paper, we propose to transform the constrained optimization problems of complex-valued ICA into unconstrained optimization problems which can be solved by limited-memory...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138246 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Summary: | Complex-valued independent component analysis (ICA) is a celebrated method in blind separation of complex-valued signals. In this paper, we propose to transform the constrained optimization problems of complex-valued ICA into unconstrained optimization problems which can be solved by limited-memory Broyden–Fletcher–Goldfarb–Shanno update (L-BFGS). As opposed to previous approaches, the proposed method does not apply any restriction on the Hessian matrix of ICA cost function. It can separate mixed sub-Gaussian, super-Gaussian, circular, and non-circular sources. Simulations show promising results. |
---|