4.6 Article Proceedings Paper

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

期刊

VISUAL COMPUTER
卷 30, 期 6-8, 页码 649-659

出版社

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

关键词

Expression modeling; Laplacian smooth; Mesh matching; Point clouds

资金

  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]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据