Spatial Transformer K-Means

Romain Cosentino, Randall Balestriero, Yanis Bahroun, Anirvan Sengupta, Richard Baraniuk, Behnaam Aazhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The K-means algorithm is one of the most employed centroid-based clustering algorithms. Unfortunately, it often requires intricate data embeddings for good performance, which comes at the cost of reduced theoretical guarantees and loss of interpretability. Instead, we propose to use the intrinsic data space and augment K-means with a similarity measure invariant to non-rigid transformations. This enables (i) the reduction of intrinsic nuisances associated with the data, making the clustering task simpler and improving performance, leading to state-of-theart results, (ii) clustering in the input space of the data, providing a fully interpretable clustering algorithm, and (iii) the benefit of convergence guarantees.

Original languageEnglish (US)
Title of host publication56th Asilomar Conference on Signals, Systems and Computers, ACSSC 2022
EditorsMichael B. Matthews
PublisherIEEE Computer Society
Pages1444-1448
Number of pages5
ISBN (Electronic)9781665459068
DOIs
StatePublished - 2022
Externally publishedYes
Event56th Asilomar Conference on Signals, Systems and Computers, ACSSC 2022 - Virtual, Online, United States
Duration: Oct 31 2022Nov 2 2022

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
Volume2022-October
ISSN (Print)1058-6393

Conference

Conference56th Asilomar Conference on Signals, Systems and Computers, ACSSC 2022
Country/TerritoryUnited States
CityVirtual, Online
Period10/31/2211/2/22

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Keywords

  • K-means
  • Spatial transformer
  • Symmetry
  • Thin plate spline interpolation

Fingerprint

Dive into the research topics of 'Spatial Transformer K-Means'. Together they form a unique fingerprint.

Cite this