4.6 Article Proceedings Paper

Dynamic 3D facial expression modeling using Laplacian smooth and multi-scale mesh matching

Journal

VISUAL COMPUTER
Volume 30, Issue 6-8, Pages 649-659

Publisher

SPRINGER
DOI: 10.1007/s00371-014-0960-3

Keywords

Expression modeling; Laplacian smooth; Mesh matching; Point clouds

Funding

  1. National Nature Science Foundation of China [61303088, 61020106001, 61332015, 61272242, U1201258]
  2. Nature Science Foundation of Shandong Province [BS2013DX039]
  3. Sci-tech Development Project of Jinan City [201303021]

Ask authors/readers for more resources

We propose a novel algorithm for the high-resolution modeling of dynamic 3D facial expressions from a sequence of unstructured face point clouds captured at video rate. The algorithm can reconstruct not only the global facial deformations caused by muscular movements, but also the expressional details generated by local skin deformations. Our algorithm consists of two parts: Extraction of expressional details and Reconstruction of expressions. In the extraction part, we extract the subtle expressional details such as wrinkles and folds from each point cloud with Laplacian smooth operator. In the reconstruction part, we use a multi-scale deformable mesh model to match each point cloud to reconstruct time-varying expressions. In each matching, we first use the low-scale mesh to match the global deformations of point cloud obtained after filtering out the expressional details, and then use the high-scale mesh to match the extracted expressional details. Comparing to many existing non-rigid ICP-based algorithms that match directly the mesh model to the entire point cloud, our algorithm overcomes the probable large errors occurred where the local sharp deformations are matched since it extracts the expressional details for separate matching, therefore, our algorithm can produce a high-resolution dynamic model reflecting time-varying expressions. Additionally, utilization of multi-scale mesh model makes our algorithm achieve high speed because it decreases iterative optimizations in matching. Experiments demonstrate the efficiency of our algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available