Approximating Intersections and Differences Between Linear Statistical Shape Models Using Markov Chain Monte Carlo

• URL: http://arxiv.org/abs/2211.16314v2
• Date: Mon, 30 Oct 2023 11:11:12 GMT
• Title: Approximating Intersections and Differences Between Linear Statistical Shape Models Using Markov Chain Monte Carlo
• Abstract summary: We present a new method to compare two linear SSMs in dense correspondence. We approximate the distribution of shapes lying in the intersection space using Markov chain Monte Carlo. We showcase the proposed algorithm qualitatively by computing and analyzing intersection spaces and differences between publicly available face models.
• Score: 5.8691349601057325
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To date, the comparison of Statistical Shape Models (SSMs) is often solely performance-based, carried out by means of simplistic metrics such as compactness, generalization, or specificity. Any similarities or differences between the actual shape spaces can neither be visualized nor quantified. In this paper, we present a new method to qualitatively compare two linear SSMs in dense correspondence by computing approximate intersection spaces and set-theoretic differences between the (hyper-ellipsoidal) allowable shape domains spanned by the models. To this end, we approximate the distribution of shapes lying in the intersection space using Markov chain Monte Carlo and subsequently apply Principal Component Analysis (PCA) to the posterior samples, eventually yielding a new SSM of the intersection space. We estimate differences between linear SSMs in a similar manner; here, however, the resulting spaces are no longer convex and we do not apply PCA but instead use the posterior samples for visualization. We showcase the proposed algorithm qualitatively by computing and analyzing intersection spaces and differences between publicly available face models, focusing on gender-specific male and female as well as identity and expression models. Our quantitative evaluation based on SSMs built from synthetic and real-world data sets provides detailed evidence that the introduced method is able to recover ground-truth intersection spaces and differences accurately.

Related papers

• Rashomon Alignment [6.742113963639309]
  Rashomon Alignment (RA) is a new measure to assess functional similarity between two models.<n>RA can be used for multiple purposes, including model selection, ensemble construction, and enhanced interpretability of machine learning models and algorithms.
  arXiv  Detail & Related papers  (2026-07-28T12:55:57Z)
• Narrative Landscape: Mapping Narrative Dispositions Across LLMs [0.7833043261515886]
  We operationalize disposition through two dimensions: "consistency", measured as cross-replication selection overlap via Jaccard similarity, and "diversity", measured as dispersion across options via the inverse Simpson index.<n>Results reveal a clear rigidity-exploration spectrum across model families and show that instruction types shift the geometry of selection spaces even when scalar metrics appear similar.
  arXiv  Detail & Related papers  (2026-05-09T07:06:57Z)
• On Procrustes Contamination in Machine Learning Applications of Geometric Morphometrics [0.0]
  Geometric morphometrics (GMM) is widely used to quantify shape variation, more recently serving as input for machine learning (ML) analyses.<n>Standard practice aligns all specimens via Generalized Procrustes Analysis (GPA) prior to splitting data into training and test sets.<n>Here, the effects of GPA-induced contamination are formally characterised using controlled 2D and 3D simulations.
  arXiv  Detail & Related papers  (2026-01-26T12:56:23Z)
• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Gaussian Mixture Model with unknown diagonal covariances via continuous sparse regularization [0.6627152091494143]
  We employ the Beurling-LASSO framework to simultaneously estimate the number of components and their parameters.<n>A key theoretical contribution is the identification of an explicit separation condition on mixture components.
  arXiv  Detail & Related papers  (2025-09-16T09:42:44Z)
• Latent Semantic Consensus For Deterministic Geometric Model Fitting [109.44565542031384]
  We propose an effective method called Latent Semantic Consensus (LSC) LSC formulates the model fitting problem into two latent semantic spaces based on data points and model hypotheses. LSC is able to provide consistent and reliable solutions within only a few milliseconds for general multi-structural model fitting.
  arXiv  Detail & Related papers  (2024-03-11T05:35:38Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• Change-point Detection and Segmentation of Discrete Data using Bayesian Context Trees [7.090165638014331]
  Building on the recently introduced Bayesian Context Trees (BCT) framework, the distributions of different segments in a discrete time series are described as variable-memory Markov chains. Inference for the presence and location of change-points is then performed via Markov chain Monte Carlo sampling. Results on both simulated and real-world data indicate that the proposed methodology performs better than or as well as state-of-the-art techniques.
  arXiv  Detail & Related papers  (2022-03-08T19:03:21Z)
• A Model for Multi-View Residual Covariances based on Perspective Deformation [88.21738020902411]
  We derive a model for the covariance of the visual residuals in multi-view SfM, odometry and SLAM setups. We validate our model with synthetic and real data and integrate it into photometric and feature-based Bundle Adjustment.
  arXiv  Detail & Related papers  (2022-02-01T21:21:56Z)
• A similarity-based Bayesian mixture-of-experts model [0.5156484100374058]
  We present a new non-parametric mixture-of-experts model for multivariate regression problems. Using a conditionally specified model, predictions for out-of-sample inputs are based on similarities to each observed data point. Posterior inference is performed on the parameters of the mixture as well as the distance metric.
  arXiv  Detail & Related papers  (2020-12-03T18:08:30Z)
• Probabilistic Circuits for Variational Inference in Discrete Graphical Models [101.28528515775842]
  Inference in discrete graphical models with variational methods is difficult. Many sampling-based methods have been proposed for estimating Evidence Lower Bound (ELBO) We propose a new approach that leverages the tractability of probabilistic circuit models, such as Sum Product Networks (SPN) We show that selective-SPNs are suitable as an expressive variational distribution, and prove that when the log-density of the target model is aweighted the corresponding ELBO can be computed analytically.
  arXiv  Detail & Related papers  (2020-10-22T05:04:38Z)
• Isometric Gaussian Process Latent Variable Model for Dissimilarity Data [0.0]
  We present a probabilistic model where the latent variable respects both the distances and the topology of the modeled data. The model is inferred by variational inference based on observations of pairwise distances.
  arXiv  Detail & Related papers  (2020-06-21T08:56:18Z)
• Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants [94.46276668068327]
  In [1], an ensemble of randomly projected linear discriminants is used to classify datasets. We develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator. We also demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.
  arXiv  Detail & Related papers  (2020-04-17T12:47:04Z)
• Bayesian System ID: Optimal management of parameter, model, and measurement uncertainty [0.0]
  We evaluate the robustness of a probabilistic formulation of system identification (ID) to sparse, noisy, and indirect data. We show that the log posterior has improved geometric properties compared with the objective function surfaces of traditional methods.
  arXiv  Detail & Related papers  (2020-03-04T22:48:30Z)
• Inverse Learning of Symmetries [71.62109774068064]
  We learn the symmetry transformation with a model consisting of two latent subspaces. Our approach is based on the deep information bottleneck in combination with a continuous mutual information regulariser. Our model outperforms state-of-the-art methods on artificial and molecular datasets.
  arXiv  Detail & Related papers  (2020-02-07T13:48:52Z)

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.