Loading…
Rationalizing Efficient Compositional Image Alignment: The Constant Jacobian Gauss-Newton Optimization Algorithm
We study the issue of computational efficiency for Gauss-Newton (GN) non-linear least-squares optimization in the context of image alignment. We introduce the Constant Jacobian Gauss-Newton (CJGN) optimization, a GN scheme with constant Jacobian and Hessian matrices, and the equivalence and independ...
Saved in:
Published in: | International journal of computer vision 2015-05, Vol.112 (3), p.354-372 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We study the issue of computational efficiency for Gauss-Newton (GN) non-linear least-squares optimization in the context of image alignment. We introduce the
Constant Jacobian Gauss-Newton
(CJGN) optimization, a GN scheme with constant Jacobian and Hessian matrices, and the
equivalence
and
independence
conditions as the necessary requirements that any function of residuals must satisfy to be optimized with this efficient approach. We prove that the
Inverse Compositional
(IC) image alignment algorithm is an instance of a CJGN scheme and formally derive the
compositional
and
extended brightness constancy
assumptions as the necessary requirements that must be satisfied by any image alignment problem so it can be solved with an efficient compositional scheme. Moreover, in contradiction with previous results, we also prove that the forward and inverse compositional algorithms are not equivalent. They are equivalent, however, when the
extended brightness constancy
assumption is satisfied. To analyze the impact of the satisfaction of these requirements we introduce a new image alignment evaluation framework and the concepts of
short-
and
wide-
baseline Jacobian. In wide-baseline Jacobian problems the optimization will diverge if the requirements are not satisfied. However, with a good initialization, a short-baseline Jacobian problem may converge even if the requirements are not satisfied. |
---|---|
ISSN: | 0920-5691 1573-1405 |
DOI: | 10.1007/s11263-014-0769-6 |