Overcomplete BSS with a Geometric Algorithm
نویسندگان
چکیده
We present an independent component analysis (ICA) algorithm based on geometric considerations [10] [11] to decompose a linear mixture of more sources than sensor signals. Bofill and Zibulevsky [2] recently proposed a two-step approach for the separation: first learn the mixing matrix, then recover the sources using a maximum-likelihood approach. We present an efficient method for the matrix-recovery step mimicking the standard geometric algorithm thus generalizing Bofill and Zibulevsky’s method.
منابع مشابه
A Histogram-based Overcomplete Ica Algorithm
Overcomplete blind source separation (BSS) tries to recover more sources from less sensor signals. We present a new approach based on an estimated histogram of the sensor data; we search for the points fulfilling the overcomplete Geometric Convergence Condition, which has been shown to be a limit condition of overcomplete geometric BSS [1]. The paper concludes with an example and a comparison o...
متن کاملFormalization of the Two-Step Approach to Overcomplete BSS
We discuss overcomplete blind source separation (BSS), that is separation with more sources than sensors. Finding the mixing matrix solves the linear quadratic BSS problem; in overcomplete BSS however, it is then still not clear and not even unique how to get the sources from the mixtures and the mixing matrix. We therefore follow Bofill and Zibulevsky in [5] and many others and take a two-step...
متن کاملHierarchical clustering applied to overcomplete BSS for convolutive mixtures
In this paper we address the problem of overcomplete BSS for convolutive mixtures following a two-step approach. In the first step the mixing matrix is estimated, which is then used to separate the signals in the second step. For estimating the mixing matrix we propose an algorithm based on hierarchical clustering, assuming that the source signals are sufficiently sparse. It has the advantage o...
متن کاملSparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved that for the estimated overcomplete basis matrix, the sparse solution (coefficient matrix) with minimum l−norm is unique with probability of one, which can be obtained using a linear programming algorithm. The comparisons...
متن کاملA Theoretical Framework for Overcomplete Geometric BMMR
Geometric algorithms for linear quadratic independent component analysis (ICA) have recently received some attention due to their pictorial description and their relative ease of implementation. The geometric approach to ICA has been proposed first by Puntonet and Prieto [15] [17] in order to separate linear mixtures. Recently it has been generalized to overcomplete cases (overcomplete geoICA) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002