Local Self-Attention With Mixing Abstract Tokens for Urban Autonomous Driving
Although local self-attentions exhibit translation equivariance and locality similar to convolution, the model has limited receptive fields and weak modeling ability. The main reason is that self-attention is computed within nonoverlapped windows. To overcome this issue, common methods need further operations to communicate the information across windows, such as window shifting, and sliding. These operations are memory unfriendly, not well supported, and optimized by modern deep-learning frameworks. Alternatively, this article exchanges information across nonoverlapped windows via efficiently mixing abstract tokens (MAT). The MAT block includes the following steps. First, the image tokens are partitioned into windows and each window is merged with an abstract token. Second, in each window, interactions of image tokens and the abstract token to image tokens are performed. Third, because the abstract token learns abstract information from each corresponding window, mixing all abstract tokens via transformer encoder helps to exchange information between local windows and result in global context modeling. Fourth, the global information of the mixed tokens is propagated back to the image tokens through transformer decoder. The MAT block is efficient and easy to implement, only containing matrix multiplications. In addition, this article also proposes a bilinear patch embedding that samples relevant regions of the input tokens based on learned offsets. Extensive experiments are conducted and evaluated with various tasks such as image classification, object detection, and segmentation. As a result, our method achieves promising performances across tasks. For example, MAT-2 accomplishes <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">79.0%</b> top-1 accuracy on ImageNet-1 K with <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.7</b> GFLOPs and outperforms the baseline Swin-0.7 G by <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4.6%</b> while reducing <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">15.2 ms</b> on CPU and <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.53 ms</b> on GPU devices. The MAT-4 surpasses Swin-T by <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1.8%</b> mIoU with only <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">70%</b> GFLOPs.
Authors
- Jehwan Choi (ORCID: https://orcid.org/0009-0005-8494-2170)
- Adri Priadana (ORCID: https://orcid.org/0000-0002-1553-7631)
- G. F. Cao (ORCID: https://orcid.org/0000-0001-9135-3888)
- Kang-Hyun Jo (ORCID: https://orcid.org/0000-0002-4937-7082)
- Xuan-Thuy Vo (ORCID: https://orcid.org/0000-0002-7411-0697)
- Duy-Linh Nguyen (ORCID: https://orcid.org/0000-0001-6184-4133)
Institutions
- University of Ulsan (KR)
Publication Details
- Journal
- IEEE Transactions on Industrial Informatics
- Published
- 2025-04-18
- DOI
- https://doi.org/10.1109/tii.2025.3555982
- Citations
- 2
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 2.55