An efficient pyramid for motion estimation

It is shown in this paper that by choosing an appropriate value for the parameter a of the generating kernel in constructing Burt and Adelson´s pyramid for motion estimation, one can eliminate the operation of floating point multiplication needed in such a construction, and reduce the computational load to the same order as in the case of the mean pyramid. It is further shown through simulation studies that this new kernel does not degrade the performance of motion estimation, as compared to that using kernels giving the best performance.