A Unified Framework for Compositional Fitting of Active Appearance Models

01/02/2016
by   Joan Alabort-i-Medina, et al.
0

Active Appearance Models (AAMs) are one of the most popular and well-established techniques for modeling deformable objects in computer vision. In this paper, we study the problem of fitting AAMs using Compositional Gradient Descent (CGD) algorithms. We present a unified and complete view of these algorithms and classify them with respect to three main characteristics: i) cost function; ii) type of composition; and iii) optimization method. Furthermore, we extend the previous view by: a) proposing a novel Bayesian cost function that can be interpreted as a general probabilistic formulation of the well-known project-out loss; b) introducing two new types of composition, asymmetric and bidirectional, that combine the gradients of both image and appearance model to derive better conver- gent and more robust CGD algorithms; and c) providing new valuable insights into existent CGD algorithms by reinterpreting them as direct applications of the Schur complement and the Wiberg method. Finally, in order to encourage open research and facilitate future comparisons with our work, we make the implementa- tion of the algorithms studied in this paper publicly available as part of the Menpo Project.

READ FULL TEXT

page 3

page 18

page 21

page 30

page 31

page 32

page 33

page 34

research
05/25/2019

Ultrametric Fitting by Gradient Descent

We study the problem of fitting an ultrametric distance to a dissimilari...
research
07/07/2023

Stability and Generalization of Stochastic Compositional Gradient Descent Algorithms

Many machine learning tasks can be formulated as a stochastic compositio...
research
07/19/2022

Riemannian Stochastic Gradient Method for Nested Composition Optimization

This work considers optimization of composition of functions in a nested...
research
08/23/2023

Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition

In this work, we establish the linear convergence estimate for the gradi...
research
07/01/2022

A Comparative Study of Graph Matching Algorithms in Computer Vision

The graph matching optimization problem is an essential component for ma...
research
02/02/2014

Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms

We study an extension of the classical graph cut problem, wherein we rep...

Please sign up or login with your details

Forgot password? Click here to reset