3 accepted papers
In this paper, we study the complex bounded component analysis (BCA) problem, under the novel scenario that the magnitudes of the latent sources are bounded. This is opposed to the existing models that assume separate bounds on the real and imaginary parts, in which case the problem can be transform…
We propose a novel formulation for dictionary learning that minimizes the determinant of the dictionary matrix, also known as its volume, subject to the constraint that each row of the sparse coefficient matrix has unit $\ell_1$ norm. The main motivation for the proposed formulation is that it provi…
In this paper, we revisit bounded component analysis (BCA) and formulate it as a geometric problem of finding the minimum volume enclosing parallelotope (MVEP) of a set of data points in the Euclidean space. A parallelotope is an affine transformation of the standard box, also known as the L<inf xml…