4.6 Article

Dynamic Texture Classification Using Directional Binarized Random Features

期刊

IEEE ACCESS
卷 11, 期 -, 页码 55895-55910

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2023.3279195

关键词

INDEX TERMS Dynamic texture; feature extraction; gradient; Gaussian derivative; local binary pattern; random feature

向作者/读者索取更多资源

In this paper, a simple and effective dynamic texture descriptor is proposed, which inherits the advantages of LBP while excluding its disadvantages. The proposed method extracts features from gradients using random projection and encodes them into integer codes. The effectiveness and efficiency of the proposed method are demonstrated through experiments on multiple benchmark datasets.
Dynamic texture description has been studied extensively due to its wide applications in the field of computer vision. Local binary pattern (LBP) and its various variants account for a large part of dynamic texture description methods because of its advantages, such as good discriminability and low computational complexity. However, many LBP-based methods directly extract feature from pixel intensities and only use a proportion of pixels in a local neighborhood. And their good classification performance is usually achieved at the cost of high feature dimensionality, which would limit their application scenarios. We argue that extracting features from the gradient domain will capture more discriminative features due to the additional directional information, and that making use of all the pixels in a local neighborhood would improve performance. In this paper, we propose a simply but effective dynamic texture descriptor that inherits the advantages of LBP while excluding its disadvantages. The proposed method consists of four stages of data processing: 1) gradients extraction; 2) random feature extraction from gradients; 3) binary hashing of directional random features; and 4) histogramming. Gaussian first-order derivatives are used as gradient filters such that stable gradients could be generated. Then random projection is applied to extract random features from each gradients. Both the above two stages are conducted via 3D filtering, and thus they are efficient. Thirdly, the random features from each gradient are binarized and encoded into integer codes, from which a histogram is built. Finally, the histograms from each gradient are concatenated into a feature vector. Because we use 8-bit codes, The feature dimensionality is very low. We evaluate the proposed method on three benchmark dynamic texture datasets with various test protocols. The results demonstrate its effectiveness and efficiency when comparing to many state-of-the-art methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据