TY - GEN
T1 - DISCRIMINANT PIXEL-DIFFERENCE VECTOR HASHING OF SPATIAL-TEMPORAL LOCAL BINARY PATTERNS FOR DYNAMIC TEXTURE RECOGNITION
AU - Ding, Ruxin
AU - Ren, Jianfeng
AU - Yu, Heng
AU - Li, Jiawei
AU - Jiang, Xudong
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Spatial-Temporal Local Binary Pattern (STLBP) has been widely used for dynamic texture (DT) recognition. Hashing Pixel-Difference Vectors (PDVs) into binary codes before forming histogram features has proven its effectiveness in improving the discriminative power of LBP features. However, hashing PDVs and forming histograms are often separated into two steps, resulting in sub-optimal LBP features. To bridge this gap, we propose to integrate the criterion of maximizing the discriminant power of LBP histogram features backwards into PDV hashing. Specifically, during PDV hashing, we propose to add the criteria of maximizing the Bhattacharyya distance between LBP histograms of different classes and minimizing the distance between LBP histograms of the same class. The histograms of hash codes are clustered to form a dictionary, and the generated codewords are used for final classification. The proposed method is evaluated on the DynTex++ dataset and a large fire-detection dataset. It significantly outperforms state-of-the-art STLBP descriptors.
AB - Spatial-Temporal Local Binary Pattern (STLBP) has been widely used for dynamic texture (DT) recognition. Hashing Pixel-Difference Vectors (PDVs) into binary codes before forming histogram features has proven its effectiveness in improving the discriminative power of LBP features. However, hashing PDVs and forming histograms are often separated into two steps, resulting in sub-optimal LBP features. To bridge this gap, we propose to integrate the criterion of maximizing the discriminant power of LBP histogram features backwards into PDV hashing. Specifically, during PDV hashing, we propose to add the criteria of maximizing the Bhattacharyya distance between LBP histograms of different classes and minimizing the distance between LBP histograms of the same class. The histograms of hash codes are clustered to form a dictionary, and the generated codewords are used for final classification. The proposed method is evaluated on the DynTex++ dataset and a large fire-detection dataset. It significantly outperforms state-of-the-art STLBP descriptors.
KW - Dynamic Texture Recognition
KW - Fire Detection
KW - Pixel-Difference Vector Hashing
KW - Spatial-Temporal Local Binary Pattern
UR - http://www.scopus.com/inward/record.url?scp=85195423227&partnerID=8YFLogxK
U2 - 10.1109/ICASSP48485.2024.10447766
DO - 10.1109/ICASSP48485.2024.10447766
M3 - Conference contribution
AN - SCOPUS:85195423227
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 6245
EP - 6249
BT - 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 49th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024
Y2 - 14 April 2024 through 19 April 2024
ER -