$k$-means on Positive Definite Matrices, and an Application to Clustering in Radar Image Sequences

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Fryer, Daniel, Nguyen, Hien, Castellazzi, Pascal
Natura: Preprint
Pubblicazione: 2020
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914995549241344
author Fryer, Daniel
Nguyen, Hien
Castellazzi, Pascal
author_facet Fryer, Daniel
Nguyen, Hien
Castellazzi, Pascal
contents We state theoretical properties for $k$-means clustering of Symmetric Positive Definite (SPD) matrices, in a non-Euclidean space, that provides a natural and favourable representation of these data. We then provide a novel application for this method, to time-series clustering of pixels in a sequence of Synthetic Aperture Radar images, via their finite-lag autocovariance matrices.
format Preprint
id arxiv_https___arxiv_org_abs_2008_03454
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle $k$-means on Positive Definite Matrices, and an Application to Clustering in Radar Image Sequences
Fryer, Daniel
Nguyen, Hien
Castellazzi, Pascal
Machine Learning
Image and Video Processing
We state theoretical properties for $k$-means clustering of Symmetric Positive Definite (SPD) matrices, in a non-Euclidean space, that provides a natural and favourable representation of these data. We then provide a novel application for this method, to time-series clustering of pixels in a sequence of Synthetic Aperture Radar images, via their finite-lag autocovariance matrices.
title $k$-means on Positive Definite Matrices, and an Application to Clustering in Radar Image Sequences
topic Machine Learning
Image and Video Processing
url https://arxiv.org/abs/2008.03454