Soft-LOST: EM on a Mixture of Oriented Lines

  • Paul D. O’Grady
  • Barak A. Pearlmutter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3195)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Karhunen, J., Hyvärinen, A., Oja, E.: Independent Component Analysis. John Wiley & Sons, Chichester (2001)Google Scholar
  2. 2.
    Dempster, P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B 39(1), 1–38 (1976)MathSciNetGoogle Scholar
  3. 3.
    Rickard, S.T., Dietrich, F.: DOA estimation of many W-disjoint orthogonal sources from two mixtures using DUET. In: Proceedings of the 10th IEEE Workshop on Statistical Signal and Array Processing (SSAP 2000), Pocono Manor, PA, August 2000, pp. 311–314 (2000)Google Scholar
  4. 4.
    Sam, T.: Roweis. One microphone source separation. In: Advances in Neural Information Processing Systems 13, pp. 793–799. MIT Press, Cambridge (2001)Google Scholar
  5. 5.
    Lee, T.-W., Lewicki, M.S., Girolami, M., Sejnowski, T.J.: Blind source separation of more sources than mixtures using overcomplete representations. IEEE Signal Processing Letters 6(4), 87–90 (1999)CrossRefGoogle Scholar
  6. 6.
    Zibulevsky, M., Pearlmutter, B.A.: Blind source separation by sparse decomposition in a signal dictionary. Neural Computation 13(4), 863–882 (2001)MATHCrossRefGoogle Scholar
  7. 7.
    Kearns, M., Mansour, Y., Ng, A.Y.: An information-theoretic analysis of hard and soft assignment methods for clustering. In: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 282–293 (1997)Google Scholar
  8. 8.
    O’Grady, P., Pearlmutter, B.: Hard-LOST: Modified k-means for oriented lines. In: Proceedings of the Irish Signals and Systems Conference (2004)Google Scholar
  9. 9.
    Paschen, E., Osgood, C., Mosby, R.P. (eds.): Poetry Speaks: Hear Great Poets Read Their Work from Tennyson to Plath. Sourcebooks Incorporated (2001) ISBN 1570717206Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Paul D. O’Grady
    • 1
  • Barak A. Pearlmutter
    • 1
  1. 1.Hamilton InstituteNational University of IrelandMaynooth, Co. KildareIreland

Personalised recommendations