Conjugate Mixture Models for Clustering Multimodal Data

12/09/2020
by   Vasil Khalidov, et al.
0

The problem of multimodal clustering arises whenever the data are gathered with several physically different sensors. Observations from different modalities are not necessarily aligned in the sense there there is no obvious way to associate or to compare them in some common space. A solution may consist in considering multiple clustering tasks independently for each modality. The main difficulty with such an approach is to guarantee that the unimodal clusterings are mutually consistent. In this paper we show that multimodal clustering can be addressed within a novel framework, namely conjugate mixture models. These models exploit the explicit transformations that are often available between an unobserved parameter space (objects) and each one of the observation spaces (sensors). We formulate the problem as a likelihood maximization task and we derive the associated conjugate expectation-maximization algorithm. The convergence properties of the proposed algorithm are thoroughly investigated. Several local/global optimization techniques are proposed in order to increase its convergence speed. Two initialization strategies are proposed and compared. A consistent model-selection criterion is proposed. The algorithm and its variants are tested and evaluated within the task of 3D localization of several speakers using both auditory and visual data.

READ FULL TEXT

page 29

page 32

page 33

research
11/12/2017

Parameter Estimation in Finite Mixture Models by Regularized Optimal Transport: A Unified Framework for Hard and Soft Clustering

In this short paper, we formulate parameter estimation for finite mixtur...
research
11/12/2018

Expectation-Maximization for Adaptive Mixture Models in Graph Optimization

Non-Gaussian and multimodal distributions are an important part of many ...
research
09/04/2015

EM Algorithms for Weighted-Data Clustering with Application to Audio-Visual Scene Analysis

Data clustering has received a lot of attention and numerous methods, al...
research
09/14/2017

A Novel Algorithm for Clustering of Data on the Unit Sphere via Mixture Models

A new maximum approximate likelihood (ML) estimation algorithm for the m...
research
03/23/2012

k-MLE: A fast algorithm for learning statistical mixture models

We describe k-MLE, a fast and efficient local search algorithm for learn...
research
08/25/2021

Clustering acoustic emission data streams with sequentially appearing clusters using mixture models

The interpretation of unlabeled acoustic emission (AE) data classically ...
research
08/11/2021

The Lawson-Hanson Algorithm with Deviation Maximization: Finite Convergence and Sparse Recovery

In this work we apply the "deviation maximization", a new column selecti...

Please sign up or login with your details

Forgot password? Click here to reset