Registration and matching using orthogonal wavelets

Algorithms for applying the orthogonal wavelet pyramid representation in matching and registration for pattern recognition are presented. They compensate for lack of translation invariance by beginning from feasible points at a coarse level and by tracking registrations through ever finer resolution levels, and they quickly compare coarse representations of candidates for matching against library prototypes without generating the intervening finer resolution representations.< >