For both Fourier and non-Fourier moving patterns, models have been proposed which detect motion based on either the net orientation of energy in the stimulus (after nonlinear stage for non-Fourier motion stimuli) or on the changes in the relative locations of spatial primitives in the image. Both approaches have been successful in accounting for detection of simple translational displacements, ...

Abstract We prove that the heavy symmetric top (Lagrange, 1788) linearizes on a two–dimensional non– compact algebraic group – the generalized Jacobian of an elliptic curve with two points identified. This leads to a transparent description of its complex and real invariant level sets. We deduce, by making use of a Baker–Akhiezer function, simple explicit formulae for the general solution of th...

For many imaging tasks, it is necessary to locate a small number of point sources with high precision from their noisy low frequency Fourier coefficients. When the point sources are located on a fine grid, this problem is equivalent to recovering a N -dimensional S-sparse complex vector from noisy observations of its first M discrete Fourier coefficients, where N M and the noise level is bounde...

In most books the Delaunay and Lagrange equations for the orbital elements are derived by the Hamilton-Jacobi method: one begins with the two-body Hamilton equations in spherical coordinates, performs a canonical transformation to the orbital elements, and obtains the Delaunay system. A standard trick is then used to generalise the approach to the N-body case. We re-examine this step and demons...

We study the convergence of the finite element method with Lagrange multipliers for approximately solving the Dirichlet problem for a second-order elliptic equation in a plane domain with piecewise smooth boundary. Assuming mesh refinements around the corners, we construct families of boundary subspaces that are compatible with triangular Lagrange elements in the interior, and we carry out the ...

Efficient computation of complex multiplication results and very efficient fast Fourier transforms (FFTs) are provided. A parallel array VLIW digital signal processor is employed along with specialized complex multiplication instructions and communication operations between the processing elements which are overlapped with computation to provide very high performance operation. Successive itera...

Efficient computation of complex multiplication results and very efficient fast Fourier transforms (FFTs) are provided. A parallel array VLIW digital signal processor is employed along with specialized complex multiplication instructions and communication operations between the processing elements which are overlapped with computation to provide very high performance operation. Successive itera...