A computational approach to the D-module of meromorphic functions

Let $D$ be a divisor in ${\bf C}^n$. We present methods to compare the ${\mathcal D}$-module of the meromorphic functions ${\mathcal O}[* D]$ to some natural approximations. We show how the analytic case can be treated with computations in the Weyl algebra.Comment: 11 page

Pyramidal Fisher Motion for Multiview Gait Recognition

The goal of this paper is to identify individuals by analyzing their gait. Instead of using binary silhouettes as input data (as done in many previous works) we propose and evaluate the use of motion descriptors based on densely sampled short-term trajectories. We take advantage of state-of-the-art people detectors to define custom spatial configurations of the descriptors around the target person. Thus, obtaining a pyramidal representation of the gait motion. The local motion features (described by the Divergence-Curl-Shear descriptor) extracted on the different spatial areas of the person are combined into a single high-level gait descriptor by using the Fisher Vector encoding. The proposed approach, coined Pyramidal Fisher Motion, is experimentally validated on the recent `AVA Multiview Gait' dataset. The results show that this new approach achieves promising results in the problem of gait recognition.Comment: Submitted to International Conference on Pattern Recognition, ICPR, 201

Encoding algebraic power series

Algebraic power series are formal power series which satisfy a univariate polynomial equation over the polynomial ring in n variables. This relation determines the series only up to conjugacy. Via the Artin-Mazur theorem and the implicit function theorem it is possible to describe algebraic series completely by a vector of polynomials in n+p variables. This vector will be the code of the series. In the paper, it is then shown how to manipulate algebraic series through their code. In particular, the Weierstrass division and the Grauert-Hironaka-Galligo division will be performed on the level of codes, thus providing a finite algorithm to compute the quotients and the remainder of the division.Comment: 35 page