Laplacian ICP for Progressive Registration of 3D Human Head Meshes

• URL: http://arxiv.org/abs/2302.02194v1
• Date: Sat, 4 Feb 2023 16:39:38 GMT
• Title: Laplacian ICP for Progressive Registration of 3D Human Head Meshes
• Authors: Nick Pears, Hang Dai, Will Smith and Hao Sun
• Abstract summary: We present a progressive 3D registration framework that is a highly-efficient variant of classical non-rigid Iterative Closest Points (N-ICP) Since it uses the Laplace-Beltrami operator for deformation regularisation, we view the overall process as Laplacian ICP (L-ICP)
• Score: 18.31701623205813
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a progressive 3D registration framework that is a highly-efficient variant of classical non-rigid Iterative Closest Points (N-ICP). Since it uses the Laplace-Beltrami operator for deformation regularisation, we view the overall process as Laplacian ICP (L-ICP). This exploits a `small deformation per iteration' assumption and is progressively coarse-to-fine, employing an increasingly flexible deformation model, an increasing number of correspondence sets, and increasingly sophisticated correspondence estimation. Correspondence matching is only permitted within predefined vertex subsets derived from domain-specific feature extractors. Additionally, we present a new benchmark and a pair of evaluation metrics for 3D non-rigid registration, based on annotation transfer. We use this to evaluate our framework on a publicly-available dataset of 3D human head scans (Headspace). The method is robust and only requires a small fraction of the computation time compared to the most popular classical approach, yet has comparable registration performance.

Related papers

• MinkUNeXt: Point Cloud-based Large-scale Place Recognition using 3D Sparse Convolutions [1.124958340749622]
  MinkUNeXt is an effective and efficient architecture for place-recognition from point clouds entirely based on the new 3D MinkNeXt Block. A thorough assessment of the proposal has been carried out using the Oxford RobotCar and the In-house datasets.
  arXiv  Detail & Related papers  (2024-03-12T12:25:54Z)
• Rethinking Few-shot 3D Point Cloud Semantic Segmentation [62.80639841429669]
  This paper revisits few-shot 3D point cloud semantic segmentation (FS-PCS) We focus on two significant issues in the state-of-the-art: foreground leakage and sparse point distribution. To address these issues, we introduce a standardized FS-PCS setting, upon which a new benchmark is built.
  arXiv  Detail & Related papers  (2024-03-01T15:14:47Z)
• Robust Outlier Rejection for 3D Registration with Variational Bayes [70.98659381852787]
  We develop a novel variational non-local network-based outlier rejection framework for robust alignment. We propose a voting-based inlier searching strategy to cluster the high-quality hypothetical inliers for transformation estimation.
  arXiv  Detail & Related papers  (2023-04-04T03:48:56Z)
• Learning Canonical Embedding for Non-rigid Shape Matching [36.85782408336389]
  This paper provides a novel framework that learns canonical embeddings for non-rigid shape matching. Our framework is trained end-to-end and thus avoids instabilities and constraints associated with the commonly-used Laplace-Beltrami basis.
  arXiv  Detail & Related papers  (2021-10-06T18:09:13Z)
• Deep Hough Voting for Robust Global Registration [52.40611370293272]
  We present an efficient framework for pairwise registration of real-world 3D scans, leveraging Hough voting in the 6D transformation parameter space. Our method outperforms state-of-the-art methods on 3DMatch and 3DLoMatch benchmarks while achieving comparable performance on KITTI odometry dataset.
  arXiv  Detail & Related papers  (2021-09-09T14:38:06Z)
• Locally Aware Piecewise Transformation Fields for 3D Human Mesh Registration [67.69257782645789]
  We propose piecewise transformation fields that learn 3D translation vectors to map any query point in posed space to its correspond position in rest-pose space. We show that fitting parametric models with poses by our network results in much better registration quality, especially for extreme poses.
  arXiv  Detail & Related papers  (2021-04-16T15:16:09Z)
• Learning 3D-3D Correspondences for One-shot Partial-to-partial Registration [66.41922513553367]
  We show that learning-based partial-to-partial registration can be achieved in a one-shot manner. We propose an Optimal Transport layer able to account for occluded points thanks to the use of bins. The resulting OPRNet framework outperforms the state of the art on standard benchmarks.
  arXiv  Detail & Related papers  (2020-06-08T12:35:47Z)
• Pre-training Is (Almost) All You Need: An Application to Commonsense Reasoning [61.32992639292889]
  Fine-tuning of pre-trained transformer models has become the standard approach for solving common NLP tasks. We introduce a new scoring method that casts a plausibility ranking task in a full-text format. We show that our method provides a much more stable training phase across random restarts.
  arXiv  Detail & Related papers  (2020-04-29T10:54:40Z)

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.