A Comparative analysis of Green’s functions of 1D matching equations for motion synthesis

Abstract

When filtering an input image, the Green’s functions of matching equations are capable of inducing a broad class of motions, a property that has led to their use in several computer graphics and computer vision applications. In all such applications, the Green’s functions of second-order differential equations have been considered, even though no justification has been given for their preference over simpler, first-order equations. Here we present a study of first-order one-dimensional matching equations, both in the uniform and in the affine motion models. Comparing their Green’s functions with those of the corresponding second-order cases, we find evidence for the latter’s superiority in motion synthesis. We also propose and discuss a general discretization scheme for Green’s functions of one-dimensional matching equations, showing that the affine motion model is particularly sensitive to the sampling frequency. In this case, we advocate the use of area sampling, for allowing realistic motion simulations.