Solving Image Registration Problems Using Interior Point Methods
Abstract
This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global convex approximation to the match function which can be optimized using interior point methods. The paper also describes how one can exploit the structure of the resulting optimization problem to develop efficient and effective matching algorithms. Results obtained by applying the proposed scheme to a variety of images are presented.
Cite
Text
Taylor and Bhusnurmath. "Solving Image Registration Problems Using Interior Point Methods." European Conference on Computer Vision, 2008. doi:10.1007/978-3-540-88693-8_47Markdown
[Taylor and Bhusnurmath. "Solving Image Registration Problems Using Interior Point Methods." European Conference on Computer Vision, 2008.](https://mlanthology.org/eccv/2008/taylor2008eccv-solving/) doi:10.1007/978-3-540-88693-8_47BibTeX
@inproceedings{taylor2008eccv-solving,
title = {{Solving Image Registration Problems Using Interior Point Methods}},
author = {Taylor, Camillo J. and Bhusnurmath, Arvind},
booktitle = {European Conference on Computer Vision},
year = {2008},
pages = {638-651},
doi = {10.1007/978-3-540-88693-8_47},
url = {https://mlanthology.org/eccv/2008/taylor2008eccv-solving/}
}