An Algorithmic Framework for Sparse Bounded Component Analysis

Bounded component analysis (BCA) is a recent approach that enables the separation of both dependent and independent signals from their mixtures. This paper introduces a novel deterministic instantaneous BCA framework for the separation of sparse bounded sources. The framework is based on a geometric...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2018-10, Vol.66 (19), p.5194-5205
Main Authors: Babatas, Eren, Erdogan, Alper T.
Format: Article
Language:English
Subjects:
blind source separation (BSS)
bounded component analysis (BCA)
Independent component analysis
independent component analysis (ICA)
Iterative algorithms
Iterative methods
Machine learning
Optimization
Particle separators
Separation
Separators
Signal processing algorithms
sparse component analysis (SCA)
Sparse matrices
Sparse source separation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bounded component analysis (BCA) is a recent approach that enables the separation of both dependent and independent signals from their mixtures. This paper introduces a novel deterministic instantaneous BCA framework for the separation of sparse bounded sources. The framework is based on a geometric maximization setting, where the objective function is defined as the volume ratio of two objects, namely, the principal hyperellipsoid and the bounding \ell _1-norm ball, defined over the separator output samples. It is shown that all global maxima of this objective are perfect separators. This paper also provides the corresponding iterative algorithms for both real and complex sparse sources. The numerical experiments illustrate the potential benefits of the proposed approach, with applications on image separation and neuron identification.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2018.2866380