Hard-LOST: Modified k-Means for Oriented Lines

Share and Export

O'Grady, Paul D. and Pearlmutter, Barak A. (2004) Hard-LOST: Modified k-Means for Oriented Lines. Proceedings, the Irish Signals and Systems Conference ISSC 2004, Belfast. pp. 247-252. ISSN 0537-9989

[thumbnail of BP_hard-LOST-ISSC2004.pdf]

PDF
BP_hard-LOST-ISSC2004.pdf
Download (137kB)

Abstract

Robust clustering of data into linear subspaces is a common problem. Here we treat clustering into 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 a modified k-means procedure, where line orientations and distances from a line replace the cluster centres and distance from cluster centres of conventional k-means. 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.

Item Type:	Article
Keywords:	Hard-LOST; Modied k-Means; Oriented Lines;
Academic Unit:	Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	2052
Depositing User:	Barak Pearlmutter
Date Deposited:	14 Jul 2010 15:44
Journal or Publication Title:	Proceedings, the Irish Signals and Systems Conference ISSC 2004, Belfast
Publisher:	IEE
Refereed:	Yes
URI:	https://mu.eprints-hosting.org/id/eprint/2052
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

MURAL - Maynooth University Research Archive Library

Hard-LOST: Modified k-Means for Oriented Lines

Abstract

Repository Staff Only (login required)

Downloads

Origin of downloads