Learning landmark geodesics using Kalman ensembles

• URL: http://arxiv.org/abs/2103.14076v1
• Date: Thu, 25 Mar 2021 18:52:01 GMT
• Title: Learning landmark geodesics using Kalman ensembles
• Authors: Andreas Bock, Colin J. Cotter
• Abstract summary: We study the problem of diffeomorphometric geodesic landmark matching. The objective is to find a diffeomorphism that via its group action maps between two sets of landmarks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of diffeomorphometric geodesic landmark matching where the objective is to find a diffeomorphism that via its group action maps between two sets of landmarks. It is well-known that the motion of the landmarks, and thereby the diffeomorphism, can be encoded by an initial momentum leading to a formulation where the landmark matching problem can be solved as an optimisation problem over such momenta. The novelty of our work lies in the application of a derivative-free Bayesian inverse method for learning the optimal momentum encoding the diffeomorphic mapping between the template and the target. The method we apply is the ensemble Kalman filter, an extension of the Kalman filter to nonlinear observation operators. We describe an efficient implementation of the algorithm and show several numerical results for various target shapes.

Related papers

• Disentangled Representation Learning with the Gromov-Monge Gap [65.73194652234848]
  Learning disentangled representations from unlabelled data is a fundamental challenge in machine learning. We introduce a novel approach to disentangled representation learning based on quadratic optimal transport. We demonstrate the effectiveness of our approach for quantifying disentanglement across four standard benchmarks.
  arXiv  Detail & Related papers  (2024-07-10T16:51:32Z)
• On Learning Gaussian Multi-index Models with Gradient Flow [57.170617397894404]
  We study gradient flow on the multi-index regression problem for high-dimensional Gaussian data. We consider a two-timescale algorithm, whereby the low-dimensional link function is learnt with a non-parametric model infinitely faster than the subspace parametrizing the low-rank projection.
  arXiv  Detail & Related papers  (2023-10-30T17:55:28Z)
• Gradient-Based Feature Learning under Structured Data [57.76552698981579]
  In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
  arXiv  Detail & Related papers  (2023-09-07T16:55:50Z)
• Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization [46.30376601157526]
  We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline. We propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings.
  arXiv  Detail & Related papers  (2022-10-05T14:07:17Z)
• Deep neural networks on diffeomorphism groups for optimal shape reparameterization [44.99833362998488]
  We propose an algorithm for constructing approximations of orientation-preserving diffeomorphisms by composition of elementary diffeomorphisms. The algorithm is implemented using PyTorch, and is applicable for both unparametrized curves and surfaces.
  arXiv  Detail & Related papers  (2022-07-22T15:25:59Z)
• Diffeomorphic Counterfactuals with Generative Models [2.9822184411723645]
  We propose a simple but effective method to generate such counterfactuals. More specifically, we perform a suitable diffeomorphic coordinate transformation and then perform gradient ascent in these coordinates to find counterfactuals which are classified with great confidence as a specified target class.
  arXiv  Detail & Related papers  (2022-06-10T13:14:21Z)
• Non-Isometric Shape Matching via Functional Maps on Landmark-Adapted Bases [27.403848280099027]
  We propose a principled approach for non-isometric landmark-preserving non-rigid shape matching. We focus instead on near-conformal maps that preserve landmarks exactly. Our method is descriptor-free, efficient and robust to significant variability mesh.
  arXiv  Detail & Related papers  (2022-05-10T11:02:14Z)
• A Gradient Sampling Algorithm for Stratified Maps with Applications to Topological Data Analysis [0.0]
  We introduce a novel gradient descent algorithm extending the well-known Gradient Sampling methodology. We then apply our method to objective functions based on the persistent homology map computed over lower-star filters.
  arXiv  Detail & Related papers  (2021-09-01T14:07:44Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Model identification and local linear convergence of coordinate descent [74.87531444344381]
  We show that cyclic coordinate descent achieves model identification in finite time for a wide class of functions. We also prove explicit local linear convergence rates for coordinate descent.
  arXiv  Detail & Related papers  (2020-10-22T16:03:19Z)
• Manifold Learning via Manifold Deflation [105.7418091051558]
  dimensionality reduction methods provide a valuable means to visualize and interpret high-dimensional data. Many popular methods can fail dramatically, even on simple two-dimensional Manifolds. This paper presents an embedding method for a novel, incremental tangent space estimator that incorporates global structure as coordinates. Empirically, we show our algorithm recovers novel and interesting embeddings on real-world and synthetic datasets.
  arXiv  Detail & Related papers  (2020-07-07T10:04:28Z)

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.