Fast simplex optimization for active appearance model

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a fast optimization method for active appearance model based on Nelder & Mead simplex in the case of mouth alignment under different expressions. This optimization defines a new constraint space. It uses a Gaussian mixture to initialize and constraint the search of an optimal solution. The Gaussian mixture is applied on the dominant eigenvectors representing the reduced data given by Principal Component Analysis. The new algorithm constraints avoid calculating errors of solutions that don't represent researched forms and textures. The constraint operator added to simplex verifies in each iteration that the solution belongs to the space of research. The tests performed in the context of generalization (learning and testing datasets are different) on two datasets show that our method presents a better convergence rate and less computation time compared to the AAM classically optimized. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Aidarous, Y., & Séguier, R. (2009). Fast simplex optimization for active appearance model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5414 LNCS, pp. 106–117). https://doi.org/10.1007/978-3-540-92957-4_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free