Reduced Representation of Deformation Fields for Effective Non-rigid Shape Matching

• URL: http://arxiv.org/abs/2211.14604v1
• Date: Sat, 26 Nov 2022 16:11:17 GMT
• Title: Reduced Representation of Deformation Fields for Effective Non-rigid Shape Matching
• Authors: Ramana Sundararaman, Riccardo Marin, Emanuele Rodola, Maks Ovsjanikov
• Abstract summary: We present a novel approach for computing correspondences between non-rigid objects by exploiting a reduced representation of deformation fields. By letting the network learn deformation parameters at a sparse set of positions in space (nodes), we reconstruct the continuous deformation field in a closed-form with guaranteed smoothness. Our model has high expressive power and is able to capture complex deformations.
• Score: 26.77241999731105
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In this work we present a novel approach for computing correspondences between non-rigid objects, by exploiting a reduced representation of deformation fields. Different from existing works that represent deformation fields by training a general-purpose neural network, we advocate for an approximation based on mesh-free methods. By letting the network learn deformation parameters at a sparse set of positions in space (nodes), we reconstruct the continuous deformation field in a closed-form with guaranteed smoothness. With this reduction in degrees of freedom, we show significant improvement in terms of data-efficiency thus enabling limited supervision. Furthermore, our approximation provides direct access to first-order derivatives of deformation fields, which facilitates enforcing desirable regularization effectively. Our resulting model has high expressive power and is able to capture complex deformations. We illustrate its effectiveness through state-of-the-art results across multiple deformable shape matching benchmarks. Our code and data are publicly available at: https://github.com/Sentient07/DeformationBasis.

Related papers

• Robustifying Generalizable Implicit Shape Networks with a Tunable Non-Parametric Model [10.316008740970037]
  Generalizable models for implicit shape reconstruction from unoriented point cloud suffer from generalization issues. We propose here an efficient mechanism to remedy some of these limitations at test time. We demonstrate the improvement obtained through our method with respect to baselines and the state-of-the-art using synthetic and real data.
  arXiv  Detail & Related papers  (2023-11-21T20:12:29Z)
• Learning-Based Biharmonic Augmentation for Point Cloud Classification [79.13962913099378]
  Biharmonic Augmentation (BA) is a novel and efficient data augmentation technique. BA diversifies point cloud data by imposing smooth non-rigid deformations on existing 3D structures. We present AdvTune, an advanced online augmentation system that integrates adversarial training.
  arXiv  Detail & Related papers  (2023-11-10T14:04:49Z)
• Spatially-varying Regularization with Conditional Transformer for Unsupervised Image Registration [11.498623409184225]
  We introduce an end-to-end framework that uses neural networks to learn a deformation regularizer directly from data. The proposed method is built upon a Transformer-based model, but it can be readily adapted to any network architecture.
  arXiv  Detail & Related papers  (2023-03-10T19:11:16Z)
• RecRecNet: Rectangling Rectified Wide-Angle Images by Thin-Plate Spline Model and DoF-based Curriculum Learning [62.86400614141706]
  We propose a new learning model, i.e., Rectangling Rectification Network (RecRecNet) Our model can flexibly warp the source structure to the target domain and achieves an end-to-end unsupervised deformation. Experiments show the superiority of our solution over the compared methods on both quantitative and qualitative evaluations.
  arXiv  Detail & Related papers  (2023-01-04T15:12:57Z)
• Topographic VAEs learn Equivariant Capsules [84.33745072274942]
  We introduce the Topographic VAE: a novel method for efficiently training deep generative models with topographically organized latent variables. We show that such a model indeed learns to organize its activations according to salient characteristics such as digit class, width, and style on MNIST. We demonstrate approximate equivariance to complex transformations, expanding upon the capabilities of existing group equivariant neural networks.
  arXiv  Detail & Related papers  (2021-09-03T09:25:57Z)
• Augmenting Implicit Neural Shape Representations with Explicit Deformation Fields [95.39603371087921]
  Implicit neural representation is a recent approach to learn shape collections as zero level-sets of neural networks. We advocate deformation-aware regularization for implicit neural representations, aiming at producing plausible deformations as latent code changes.
  arXiv  Detail & Related papers  (2021-08-19T22:07:08Z)
• A method for large diffeomorphic registration via broken geodesics [3.2188961353850187]
  Anatomical variabilities seen in longitudinal data or inter-subject data are usually described by the underlying deformation. Non-rigid registration algorithms are widely used for registration. We propose a method to break down the large deformation into finite compositions of small deformations.
  arXiv  Detail & Related papers  (2020-11-29T06:14:53Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)
• NiLBS: Neural Inverse Linear Blend Skinning [59.22647012489496]
  We introduce a method to invert the deformations undergone via traditional skinning techniques via a neural network parameterized by pose. The ability to invert these deformations allows values (e.g., distance function, signed distance function, occupancy) to be pre-computed at rest pose, and then efficiently queried when the character is deformed.
  arXiv  Detail & Related papers  (2020-04-06T20:46:37Z)

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.