Infinite Gaussian Fisher Vector to Support Video-Based Human Action Recognition
| Autor: | Álvaro Orozco-Gutiérrez, Andrés Marino Álvarez-Meza, Jorge L. Fernández-Ramírez, Julián D. Echeverry-Correa |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computational complexity theory
Computer science Gaussian Inference 020207 software engineering Markov chain Monte Carlo 02 engineering and technology Video processing Mixture model Maxima and minima symbols.namesake Encoding (memory) 0202 electrical engineering electronic engineering information engineering symbols 020201 artificial intelligence & image processing Algorithm |
| Zdroj: | Advances in Visual Computing ISBN: 9783030337223 ISVC (2) |
| DOI: | 10.1007/978-3-030-33723-0_4 |
| Popis: | Human Action Recognition (HAR) is a computer vision task that attempts to monitor, understand, and characterize humans in videos. Here, we introduce an extension to the conventional Fisher Vector encoding technique to support this task. The methodology, based on the Infinite Gaussian Mixture Model (IGMM) seeks to reveal a set of discriminant local spatio-temporal features for enabling the precise codification of visual information. Specifically, it is much simpler to handle the infinite limit from the IGMM, than working with traditional Gaussian Mixture Models (GMMs) with unknown sizes, that will require extensive cross-validation. Under this premise, we developed a fully automatic encoding methodology that avoids heuristically specifying the number of components in the mixture model. This parameter is known to greatly affect the recognition performance, and its inference with conventional methods implies a high computational burden. Moreover, the Markov Chain Monte Carlo implementation of the hierarchical IGMM effectively avoids local minima, which tend to plague mixtures trained by optimization-based methods. Attained results on the UCF50 and HMDB51 databases demonstrate that our proposal outperforms state of the art encoding approaches concerning the trade-off between recognition performance and computational complexity, as it drastically reduces both number of operations and memory requirements. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|