Laplacian ICP for Progressive Registration of 3D Human Head Meshes

Nick Pears, Hang Dai, Will Smith, Hao Sun
2/4/2023
cs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{pears2023laplacian,
  title  = {Laplacian ICP for Progressive Registration of 3D Human Head Meshes},
  author = {Nick Pears and Hang Dai and Will Smith and Hao Sun},
  year   = {2023},
  eprint = {2302.02194},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.02194v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.02194.svg)](https://codeofpaper.com/paper/2302.02194)

Discussion