k-means on a log-Cholesky Manifold, with Unsupervised Classification of Radar Products

08/08/2020
by   Daniel Fryer, et al.
14

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 6

01/04/2016

Kernel Sparse Subspace Clustering on Symmetric Positive Definite Manifolds

Sparse subspace clustering (SSC), as one of the most successful subspace...
06/02/2020

Inductive Geometric Matrix Midranges

Covariance data as represented by symmetric positive definite (SPD) matr...
01/28/2020

WISDoM: a framework for the Analysis of Wishart distributed matrices

WISDoM (Wishart Distributed Matrices) is a new framework for the charact...
01/27/2016

Neighborhood Preserved Sparse Representation for Robust Classification on Symmetric Positive Definite Matrices

Due to its promising classification performance, sparse representation b...
07/08/2019

Modeling Symmetric Positive Definite Matrices with An Application to Functional Brain Connectivity

In neuroscience, functional brain connectivity describes the connectivit...
01/26/2021

essHi-C: Essential component analysis of Hi-C matrices

Motivation: Hi-C matrices are cornerstones for qualitative and quantitat...
01/10/2016

On Clustering Time Series Using Euclidean Distance and Pearson Correlation

For time series comparisons, it has often been observed that z-score nor...

Code Repositories

kmspd

k-means on symmetric positive definite matrices


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.