no code implementations • 8 Jun 2020 • Ahmed Mazari, Hichem Sahbi
While convolutional and fully connected operations have been widely studied in the literature, the design of pooling operations that handle action recognition, with different sources of temporal granularity in action categories, has comparatively received less attention, and existing solutions rely mainly on max or averaging operations.
no code implementations • 8 Jun 2020 • Ahmed Mazari, Hichem Sahbi
In this paper, we introduce a novel hierarchical aggregation design that captures different levels of temporal granularity in action recognition.
no code implementations • 15 Oct 2019 • Ahmed Mazari, Hichem Sahbi
The main contribution of this method resides in a new design principle that learns graph-laplacians as convex combinations of other elementary laplacians each one dedicated to a particular topology of the input graphs.
no code implementations • 30th British Machine Vision Conference 2019 • Ahmed Mazari, Hichem Sahbi
We also introduce a novel pooling operator, on graphs, that proceeds in two steps: context-dependent node expansion is achieved, followed by a global average pooling; the strength of this two-step process resides in its ability to preserve the discrimination power of nodes while achieving permutation invariance.
Ranked #2 on Skeleton Based Action Recognition on SBU
no code implementations • 2 May 2019 • Ahmed Mazari, Hichem Sahbi
Our solution is based on a tree-structured temporal pyramid that aggregates outputs of CNNs at different levels.