# Gaussian model for closed curves

arXiv: https://arxiv.org/abs/2304.01367 · HTML: https://mlsanity.com/paper/2304.01367/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 3 of its 62 references that are in the map.
- First posted on arXiv 3 Apr 2023.

## Builds on (most cited first, 3 of 3)

- [MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves](https://mlsanity.com/paper/2010.10726/) (2020)
- [Active Function Cross-Entropy Clustering](https://mlsanity.com/paper/1502.01943/) (2015)
- [Robust Ellipse Fitting Based on Maximum Correntropy Criterion With Variable Center](https://mlsanity.com/paper/2210.12915/) (2022)

## Built on by (most cited first, 1 of 1)

- [Parsimonious Gaussian mixture models with piecewise-constant eigenvalue profiles](https://mlsanity.com/paper/2507.01542/) (2025)

## Abstract (arXiv)

Gaussian Mixture Models (GMM) do not adapt well to curved and strongly nonlinear data. However, we can use Gaussians in the curvilinear coordinate systems to solve this problem. Moreover, such a solution allows for the adaptation of clusters to the complicated shapes defined by the family of functions. But still, it is challenging to model clusters as closed curves (e.g., circles, ellipses, etc.). In this work, we propose a density representation of the closed curve, which can be used to detect the complicated templates in the data. For this purpose, we define a new probability distribution to model closed curves. Then we construct a mixture of such distributions and show that it can be effectively trained in the case of the one-dimensional closed curves.
