ML Anthology

Equivalence and Efficiency of Image Alignment Algorithms

Simon Baker, Iain A. Matthews
CVPR 2001 pp. I:1090-1097
doi:10.1109/CVPR.2001.990652 /cvpr/2001/baker2001cvpr-equivalence/

Abstract

There are two major formulations of image alignment using gradient descent. The first estimates an additive increment to the parameters (the additive approach), the second an incremental warp (the compositional approach). We first prove that these two formulations are equivalent. A very efficient algorithm was recently proposed by Hager and Belhumeur using the additive approach that unfortunately can only be applied to a very restricted class of warps. We show that using the compositional approach an equally efficient algorithm (the inverse compositional algorithm) can be derived that can be applied to any set of warps which form a group. While most warps used in computer vision form groups, there are a certain warps that do not. Perhaps most notable is the set of piecewise affine warps used in Flexible Appearance Models (FAMs). We end this paper by extending the inverse compositional algorithm to apply to FAMs. 1

PDF CVPR Semantic Scholar

Cite

Text

Baker and Matthews. "Equivalence and Efficiency of Image Alignment Algorithms." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001. doi:10.1109/CVPR.2001.990652

Markdown

[Baker and Matthews. "Equivalence and Efficiency of Image Alignment Algorithms." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001.](https://mlanthology.org/cvpr/2001/baker2001cvpr-equivalence/) doi:10.1109/CVPR.2001.990652

BibTeX

@inproceedings{baker2001cvpr-equivalence,
  title     = {{Equivalence and Efficiency of Image Alignment Algorithms}},
  author    = {Baker, Simon and Matthews, Iain A.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2001},
  pages     = {I:1090-1097},
  doi       = {10.1109/CVPR.2001.990652},
  url       = {https://mlanthology.org/cvpr/2001/baker2001cvpr-equivalence/}
}