Enforcing Convexity for Improved Alignment with Constrained Local Models - Robotics Institute Carnegie Mellon University

Enforcing Convexity for Improved Alignment with Constrained Local Models

Yang Wang, Simon Lucey, and Jeffrey Cohn
Conference Paper, Proceedings of (CVPR) Computer Vision and Pattern Recognition, June, 2008

Abstract

Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A major problem hindering the development of CLMs further, for non-rigid object alignment/tracking, is how to jointly optimize the global warp update across all local search responses. Previous methods have either used general purpose optimizers (e.g., simplex methods) or graph based optimization techniques. Unfortunately, problems exist with both these approaches when applied to CLMs. In this paper, we propose a new approach for optimizing the global warp update in an ef?cient manner by enforcing convexity at each local patch response surface. Furthermore, we show that the classic Lucas-Kanade approach to gradient descent image alignment can be viewed as a special case of our proposed framework. Finally, we demonstrate that our approach receives improved performance for the task of non-rigid face alignment/tracking on the MultiPIE database and the UNBC-McMaster archive.

BibTeX

@conference{Wang-2008-9986,
author = {Yang Wang and Simon Lucey and Jeffrey Cohn},
title = {Enforcing Convexity for Improved Alignment with Constrained Local Models},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2008},
month = {June},
keywords = {Active Appearance Models, Constrained Local Models},
}