Gaussian model for closed curves

• URL: http://arxiv.org/abs/2304.01367v1
• Date: Mon, 3 Apr 2023 20:48:02 GMT
• Title: Gaussian model for closed curves
• Abstract summary: We propose a density representation of the closed curve, which can be used to detect the complicated templates in the data. We construct a mixture of such distributions and show that it can be effectively trained in the case of the one-dimensional closed curves.
• Score: 11.464276049587587
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Deep Shape Regression for Planar Curves with Multimodal Covariates [0.0]
  Shape of a planar curve is the geometric information that remains once translation, rotation, scale and reparametrisation are removed.<n>We propose a deep shape regression model for open planar curves.<n>We show that the conditional full Procrustes mean is the leading eigenfunction of the conditional covariance surface.
  arXiv  Detail & Related papers  (2026-07-21T22:04:17Z)
• A Geometric Gaussian Mixture Representation of Plane Curves [16.543301505319103]
  We introduce a user defined probabilistic polygonal representation for plane curves.<n>Each segment is equipped with a user defined uncertainty parameter in the normal direction.<n>Experiments on a collection of canonical plane curves show that the resulting GMM capture local tangent, local normal, and local arc length.
  arXiv  Detail & Related papers  (2026-05-24T16:19:27Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Distributional Stability of Tangent-Linearized Gaussian Inference on Smooth Manifolds [3.632189127068905]
  We derive explicit non-asymptotic $W$ stability bounds for projection marginalization and surface-measure conditioning.<n>The bounds separate local second-order geometric distortion from nonlocal tail leakage.<n>Experiments validate the predicted calibration transition near $sqrt||_mathrmop/Rapprox 1/6$ and indicate that normal-direction uncertainty is the dominant failure mode when locality breaks.
  arXiv  Detail & Related papers  (2026-02-22T13:18:45Z)
• Rolled Gaussian process models for curves on manifolds [3.499870393443268]
  rolling operation induces a local isometry between the sphere and the plane so that the two curves uniquely determine each other. We use rolling to construct an analogue of a Gaussian process on a manifold starting from a Euclidean Gaussian process. The resulting model is generative, and is amenable to statistical inference given data as curves on a manifold.
  arXiv  Detail & Related papers  (2025-03-27T20:52:18Z)
• Computation-Aware Gaussian Processes: Model Selection And Linear-Time Inference [55.150117654242706]
  We show that model selection for computation-aware GPs trained on 1.8 million data points can be done within a few hours on a single GPU. As a result of this work, Gaussian processes can be trained on large-scale datasets without significantly compromising their ability to quantify uncertainty.
  arXiv  Detail & Related papers  (2024-11-01T21:11:48Z)
• von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
  We explore a family of expressive and interpretable distributions over circle-valued random functions. The resulting probability model has connections with continuous spin models in statistical physics. For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
  arXiv  Detail & Related papers  (2024-06-19T01:57:21Z)
• Fusion of Gaussian Processes Predictions with Monte Carlo Sampling [61.31380086717422]
  In science and engineering, we often work with models designed for accurate prediction of variables of interest. Recognizing that these models are approximations of reality, it becomes desirable to apply multiple models to the same data and integrate their outcomes.
  arXiv  Detail & Related papers  (2024-03-03T04:21:21Z)
• SIGMA: Scale-Invariant Global Sparse Shape Matching [50.385414715675076]
  We propose a novel mixed-integer programming (MIP) formulation for generating precise sparse correspondences for non-rigid shapes. We show state-of-the-art results for sparse non-rigid matching on several challenging 3D datasets.
  arXiv  Detail & Related papers  (2023-08-16T14:25:30Z)
• The Parametric Stability of Well-separated Spherical Gaussian Mixtures [7.238973585403367]
  We quantify the parameter stability of a spherical Gaussian Mixture Model (sGMM) under small perturbations in distribution space. We derive the first explicit bound to show that for a mixture of spherical Gaussian $P$ (sGMM) in a pre-defined model class, all other sGMM close to $P in this model class in total variation distance has a small parameter distance to $P.
  arXiv  Detail & Related papers  (2023-02-01T04:52:13Z)
• Machine learning algorithms for three-dimensional mean-curvature computation in the level-set method [0.0]
  We propose a data-driven mean-curvature solver for the level-set method. Our proposed system can yield more accurate mean-curvature estimations than modern particle-based interface reconstruction.
  arXiv  Detail & Related papers  (2022-08-18T20:19:22Z)
• A piece-wise constant approximation for non-conjugate Gaussian Process models [0.0]
  This paper proposes to approximate the inverse-link function, which is necessary when working with non-Gaussian likelihoods. It will be shown that this yields a closed form solution for the corresponding SVGP lower bound. In addition, it is demonstrated how the piece-wise constant function itself can be optimized, resulting in an inverse-link function that can be learnt from the data at hand.
  arXiv  Detail & Related papers  (2022-04-22T08:53:54Z)
• Gaussian Mixture Convolution Networks [13.493166990188278]
  This paper proposes a novel method for deep learning based on the analytical convolution of multidimensional Gaussian mixtures. We demonstrate that networks based on this architecture reach competitive accuracy on Gaussian mixtures fitted to the MNIST and ModelNet data sets.
  arXiv  Detail & Related papers  (2022-02-18T12:07:52Z)
• The Schr\"odinger Bridge between Gaussian Measures has a Closed Form [101.79851806388699]
  We focus on the dynamic formulation of OT, also known as the Schr"odinger bridge (SB) problem. In this paper, we provide closed-form expressions for SBs between Gaussian measures.
  arXiv  Detail & Related papers  (2022-02-11T15:59:01Z)
• A Robust and Flexible EM Algorithm for Mixtures of Elliptical Distributions with Missing Data [71.9573352891936]
  This paper tackles the problem of missing data imputation for noisy and non-Gaussian data. A new EM algorithm is investigated for mixtures of elliptical distributions with the property of handling potential missing data. Experimental results on synthetic data demonstrate that the proposed algorithm is robust to outliers and can be used with non-Gaussian data.
  arXiv  Detail & Related papers  (2022-01-28T10:01:37Z)
• On Linear Interpolation in the Latent Space of Deep Generative Models [0.0]
  Smoothness and plausibility of linears in latent space are associated with the quality of the underlying generative model. We show that not all such curves are comparable as they can deviate arbitrarily from the shortest curve given by the geodesic. This deviation is revealed by computing curve lengths with the pull-back metric of the generative model.
  arXiv  Detail & Related papers  (2021-05-08T10:27:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.