Bounded Component Analysis of Linear Mixtures: A Criterion of Minimum Convex Perimeter

This study presents a blind and geometric technique which pursues the linear decomposition of the observations in bounded component signals. The bounded component analysis of the observations relies on the hypotheses of compactness and Cartesian decomposition of the convex support of the vector of component signals, and in the invertibility of the mixture. Assumptions, which in absence of noise, are able to guarantee the identifiability of the mixture and separability of the components, up to permutation, scaling, and phase ambiguities. Under these conditions, the convex perimeter of the normalized linear combination of the observations is shown to be a global contrast function whose minima correspond with the extraction of bounded components of the observations. Practical extraction and separation algorithms based on the minimization of this criterion are given. The experimental results with communications signals serve to illustrate the good performance of the proposed method in high SNR scenarios, even for a small number of samples.