Research on the Application of Pruning Algorithm Based on Local Linear Embedding Method in Traffic Sign Recognition
-
Published:2024-08-15
Issue:16
Volume:14
Page:7184
-
ISSN:2076-3417
-
Container-title:Applied Sciences
-
language:en
-
Short-container-title:Applied Sciences
Affiliation:
1. Foundation Department, Liaoning Technical University, Huludao 125105, China 2. School of Electronics and Information Engineering, Liaoning Technical University, Huludao 125105, China
Abstract
Efficient traffic sign recognition is crucial to facilitating the intelligent driving of new energy vehicles. However, current approaches like the Vision Transformer (ViT) model often impose high storage and computational demands, escalating hardware costs. This paper presents a similarity filter pruning method based on locally linear embedding. Using the alternating direction multiplier method and the loss of the locally linear embedding method for the model training function, the proposed pruning method prunes the operation model mainly by evaluating the similarity of each layer in the network layer filters. According to the pre-set pruning threshold value, similar filters to be pruned are obtained, and the filter with a large cross-entropy value is retained. The results from the Belgium Traffic Sign (BelgiumTS) and German Traffic Sign Recognition Benchmark (GTSRB) datasets indicate that the proposed similarity filter pruning based on local linear embedding (SJ-LLE) pruning algorithm can reduce the number of parameters of the multi-head self-attention module and Multi-layer Perceptron (MLP) module of the ViT model by more than 60%, and the loss of model accuracy is acceptable. The scale of the ViT model is greatly reduced, which is conducive to applying this model in embedded traffic sign recognition equipment. Also, this paper proves the hypothesis through experiments that “using the LLE algorithm as the loss function for model training before pruning plays a positive role in reducing the loss of model performance in the pruning process”.
Funder
the National Natural Science Foundation of China the Basic Research Projects of the Liaoning Provincial Department of Education
Reference24 articles.
1. Cireşan, D., Meier, U., Masci, J., and Schmidhuber, J. (August, January 31). A committee of neural networks for traffic sign classification. Proceedings of The 2011 International Joint Conference on Neural Networks, San Jose, CA, USA. 2. Xu, Y., Wang, Y., Zhou, A., Lin, W., and Xiong, H. (2018, January 2–7). Deep neural network compression with single and multiple level quantization. Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, LA, USA. 3. Qiu, Q., Cheng, X., and Sapiro, G. (2018, January 10–15). DCFNet: Deep neural network with decomposed convolutional filters. Proceedings of the International Conference on Machine Learning, Stockholm, Sweden. 4. Shen, Y., Xu, L., Yang, Y., Li, Y., and Guo, Y. (2022, January 18–24). Self-distillation from the last mini-batch for consistency regularization. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, New Orleans, LA, USA. 5. Rahimian, E., Javadi, G., Tung, F., and Oliveira, G. (2023, January 17–24). DynaShare: Task and instance conditioned parameter sharing for multi-task learning. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Vancouver, BC, Canada.
|
|