Laplacian and orthogonal wavelet pyramid decompositions in coarse-to-fine registration

Abstract

The authors develop orthogonal wavelet pyramid methods for registration and matching. The registration algorithm described compensates for the representation's lack of translation invariance. It shows better performance when tested with Laplacian pyramids. For matching applications, they derive filters that directly generate coarse representations of candidates for comparison to library prototypes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>