ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2019
DOI: 10.1109/icassp.2019.8683054
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Texture Recognition Using 3D Random Features

Abstract: In this paper, we present a novel, simple but effective approach for dynamic texture recognition using 3D random features. Compared with the existing dynamic texture recognition approaches using carefully designed features for high performance, our method use only a few 3D random filters to extract spatio-temporal features from local dynamic texture blocks, which are further encoded into a low-dimensional feature vector. To explore the representative power of the 3D random features, we use two different encodi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 31 publications
0
8
0
Order By: Relevance
“…Fisher vector [86] encoding has also been used to build dictionaries from DTs. Zhao et al [23] first extracted 3D random features from sampled 3D blocks and then trained a Gaussian mixture model (GMM), after which Fisher vector encoding was applied to generate DT feature vectors (denoted as 3DRF). Later, Xiong et al [24] extended 3DRF by replacing the random filters with those learned via independent component analysis.…”
Section: F Learning-based Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Fisher vector [86] encoding has also been used to build dictionaries from DTs. Zhao et al [23] first extracted 3D random features from sampled 3D blocks and then trained a Gaussian mixture model (GMM), after which Fisher vector encoding was applied to generate DT feature vectors (denoted as 3DRF). Later, Xiong et al [24] extended 3DRF by replacing the random filters with those learned via independent component analysis.…”
Section: F Learning-based Methodsmentioning
confidence: 99%
“…After obtaining a bunch of vectors of L random features from a DT, the task is to aggregate those local features into a global feature vector that could be used for DT classification. Several commonly used techniques are dictionary learning [26], [92], [93], k-means clustering [96], Fisher vector encoding [23], and histogramming on local binary codes [22], [25]. The former three techniques require a training process to generate a dictionary or a set of cluster centers (used as a dictionary), which is not in line with our goal.…”
Section: Binary Encoding and Histogrammingmentioning
confidence: 99%
See 2 more Smart Citations
“…However, they have known limitations that can make them unfeasible for many real-world problems, such as their difficulty to be implemented on embedded platforms, and the need for a considerable number of training samples, that can be impossible to get, particularly when online adaptation/learning is needed. Zhao et al [34] explore two different approaches to learn 3D random features: learning-based Fisher vector and the learning-free binary encoding. In [35] is proposed a DT descriptor, which employs Randomized Neural Networks (RNNs) to learn the local features from three orthogonal planes.…”
Section: Discrimination-based Methods Generally Use Local Features Such As the Localmentioning
confidence: 99%