Improved Matching Algorithms for Linear Face Class Model

Fu Yun、 Zheng Nanning

Strategic Study of CAE ›› 2005, Vol. 7 ›› Issue (2) : 47-56.

PDF(14649 KB)
PDF(14649 KB)
Strategic Study of CAE ›› 2005, Vol. 7 ›› Issue (2) : 47-56.
Academic Papers

Improved Matching Algorithms for Linear Face Class Model

  • Fu Yun、 Zheng Nanning

Author information +
History +

Abstract

An advanced matching technique for linear face class model is proposed, which can solve the problem of detailed controlling and robust iteration for the realistic facial modeling. A new method——Dynamic Gaussian Pyramid Analysis (DGPA), which combines Non-Uniform Sampling (NUS) method and Multi-Resolution Analysis, is presented. Integrating the PS Sampling and the Cluster Random Sampling, the distribution of the sampled points in each level images of the Gaussian pyramid is adjusted dynamically. In coarse-to-fine scheme, the minimization algorithm is used to compute the near global optimal solution that may fit to yield accurate model matching. Dynamic adjusting the boundary of the sampling cluster area and the resampling ratio, the detailed representations are effectively controlled, and the model creation is quite robust. An improved Stochastic Gradient Descent (SGD) algorithm based on the Correlative Disturbance (CD) and Adaptive Learning Rate (ALR) is exploited to accelerate iteration convergence and compute valid model parameters. With the examples of MPI Caucasian Face and AI&R Asian Face databases, experimental results in subjective evaluation and objective evaluation demonstrate the advanced model matching technique.

Keywords

facial modeling / model matching / stochastic gradient descent / non-uniform sampling / multiresolution analysis

Cite this article

Download citation ▾
Fu Yun,Zheng Nanning. Improved Matching Algorithms for Linear Face Class Model. Strategic Study of CAE, 2005, 7(2): 47‒56
AI Summary AI Mindmap
PDF(14649 KB)

Accesses

Citations

Detail

Sections
Recommended

/