Robust sparse component analysis based on a generalized hough transform

Fabian J. Theis, Pando Georgiev, Andrzej Cichocki

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

An algorithm called Hough SCA is presented for recovering the matrix A in x(t)=As(t), where x(t) is a multivariate observed signal, possibly is of lower dimension than the unknown sources s(t). They are assumed to be sparse in the sense that at every time instant t, s(t) has fewer nonzero elements than the dimension ofx(t). The presented algorithm performs a global search for hyperplane clusters within the mixture space by gathering possible hyperplane parameters within a Hough accumulator tensor.This renders the algorithm immune to the many local minima typically exhibited by the corresponding cost function. In contrast to previous approaches, Hough SCA is linear in the sample number and independent of the source dimension as well as robust against noise and outliers. Experiments demonstrate the flexibility of the proposed algorithm.

Original languageEnglish
Article number52105
JournalEurasip Journal on Advances in Signal Processing
Volume2007
DOIs
Publication statusPublished - 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'Robust sparse component analysis based on a generalized hough transform'. Together they form a unique fingerprint.

Cite this