NUI Maynooth

NUIM ePrints and eTheses Archive

NUIM Library

Hard-LOST: Modi ed k-Means for Oriented Lines

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

[img] 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 identi es these subspaces using a modi ed 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; Modi ed k-Means; Oriented Lines;
Subjects: Science & Engineering > Hamilton Institute
Science & Engineering > Computer Science
Item ID: 2052
Depositing User: Dr. 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:

    Repository Staff Only(login required)

    View Item Item control page

    Document Downloads

    More statistics for this item...