ICA with Orthogonality Constraint: Identifiability And A New Efficient Algorithm
Links to Fileshttps://ieeexplore.ieee.org/document/9415059
MetadataShow full item record
Type of Work5 pages
journal articles preprints
Citation of Original PublicationGabrielson, Ben; Akhonda, M. A. B. S.; Boukouvalas, Zois; Kim, Seung-Jun; Adali, Tülay; ICA with Orthogonality Constraint: Identifiability And A New Efficient Algorithm; ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 13, 2021; https://doi.org/10.1109/ICASSP39728.2021.9415059
RightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Given the prevalence of independent component analysis (ICA) for signal processing, many methods for improving the convergence properties of ICA have been introduced. The most utilized methods operate by iterative rotations over pre-whitened data, whereby limiting the space of estimated demixing matrices to those that are orthogonal. However, a proof of the identifiability conditions for orthogonal ICA methods has not yet been presented in the literature. In this paper, we derive the identifiability conditions, starting from the orthogonal ICA maximum likelihood cost function. We then review efficient optimization approaches for orthogonal ICA defined on the Lie group of orthogonal matrices. Afterwards, we derive a new efficient algorithm for orthogonal ICA, by defining a mapping onto a space of constrained matrices which we define as hyper skew-symmetric. Finally, we experimentally demonstrate the advantages of the new algorithm over the pre-existing Lie group methods.