Postnonlinear overcomplete blind source separation using sparse sources

Abstract

We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1× ... × fm with one-dimensional functions fi and A an m × n matrix. This postnonlinear model is allowed to be overcomplete, which means that less observations than sources (m < n) are given. In contrast to Independent Component Analysis (ICA) we do not assume the sources s to be independent but to be sparse in the sense that at each time instant they have at most m -1 non-zero components (Sparse Component Analysis or SCA). Identifiability of the model is shown, and an algorithm for model and source recovery is proposed. It first detects the postnonlinearities in each component, and then identifies the now linearized model using previous results. © Springer-Verlag 2004.