Soft-LOST: EM on a mixture of oriented lines (2004) [4 citations — 1 self]
Download:
|
|
by Paul D. O'grady, Barak A Pearlmutter
in Proc. ICA 2004, ser. Lecture Notes in Computer Science
http://www-bcl.cs.may.ie/~bap/papers/soft-LOST-ICA2004.ps.gz
Add To MetaCart
Abstract:
Abstract. Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We present an algorithm that identifies these subspaces using an EM procedure, where the E-step calculates posterior probabilities assigning data points to lines and M-step repositions the lines to match the points assigned to them. This method, combined with a transformation into a sparse domain and an L1-norm optimisation, constitutes a blind source separation algorithm for the under-determined case. 1
Citations
| 4344 | Maximum likelihood from incomplete data via the EM algorithm – Dempster, Laird, et al. - 1977 |
| 89 | source separation by sparse decomposition in a signal dictionary – Zibulevsky, Pearlmutter, et al. - 2000 |
| 66 | An informationtheoretic analysis of hard and soft assignment methods for clustering – Kearns, Mansour, et al. - 1997 |
| 60 | Blind source separation of more sources than mixtures using overcomplete representations – Lee, Lewicki, et al. - 1999 |
| 46 | One microphone source separation – Roweis |
| 6 | DOA estimation of many W -disjoint orthogonal sources from two mixtures using DUET – Rickard, Dietrich - 2000 |
| 6 | DOA Estimation of Many W-Disjoint Orthogonal Sources From Two Mixtures Using Duet – Rickard, Dietrich - 2000 |
| 3 | Hard-LOST: Modified k-means for oriented lines – O’Grady, Pearlmutter |
