Structure Inference Machines: Recurrent Neural Networks for Analyzing Relations in Group Activity Recognition
Rich semantic relations are important in a variety of visual recognition problems. As a concrete example, group activity recognition involves the interactions and relative spatial relations of a set of people in a scene. State of the art recognition methods center on deep learning approaches for training highly effective, complex classifiers for interpreting images. However, bridging the relatively low-level concepts output by these methods to interpret higher-level compositional scenes remains a challenge. Graphical models are a standard tool for this task. In this paper, we propose a method to integrate graphical models and deep neural networks into a joint framework. Instead of using a traditional inference method, we use a sequential inference modeled by a recurrent neural network. Beyond this, the appropriate structure for inference can be learned by imposing gates on edges between nodes. Empirical results on group activity recognition demonstrate the potential of this model to handle highly structured learning tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Activity RecognitionGroup Activity RecognitionSimilar Papers 제목 키워드 기반
Recurrent Inference Machines for Solving Inverse Problems
Much of the recent research on solving iterative inference problems focuses on moving away from hand-chosen inference algorithms and towards learned inference. In the latter, the inference process is unrolled in time and…
DenoisingImage DenoisingImage RestorationSuper-ResolutionDeep Gate Recurrent Neural Network
This paper introduces two recurrent neural network structures called Simple Gated Unit (SGU) and Deep Simple Gated Unit (DSGU), which are general structures for learning long term dependencies. Compared to traditional Lo…
Effective Mean-Field Inference Method for Nonnegative Boltzmann Machines
Nonnegative Boltzmann machines (NNBMs) are recurrent probabilistic neural network models that can describe multi-modal nonnegative data. NNBMs form rectified Gaussian distributions that appear in biological neural networ…
Re-understanding Finite-State Representations of Recurrent Policy Networks
We introduce an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM…
Atari GamesFeedforward Initialization for Fast Inference of Deep Generative Networks is biologically plausible
We consider deep multi-layered generative models such as Boltzmann machines or Hopfield nets in which computation (which implements inference) is both recurrent and stochastic, but where the recurrence is not to model se…