mlsanityData to 14 Oct 2026

The revenge of BiSeNet: Efficient Multi-Task Image Segmentation

arXiv 2404.09570 ↗First posted 15 Apr 2024cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Recent advancements in image segmentation have focused on enhancing the efficiency of the models to meet the demands of real-time applications, especially on edge devices. However, existing research has primarily concentrated on single-task settings, especially on semantic segmentation, leading to redundant efforts and specialized architectures for different tasks. To address this limitation, we propose a novel architecture for efficient multi-task image segmentation, capable of handling various segmentation tasks without sacrificing efficiency or accuracy. We introduce BiSeNetFormer, that leverages the efficiency of two-stream semantic segmentation architectures and it extends them into a mask classification framework. Our approach maintains the efficient spatial and context paths to capture detailed and semantic information, respectively, while leveraging an efficient transformed-based segmentation head that computes the binary masks and class probabilities. By seamlessly supporting multiple tasks, namely semantic and panoptic segmentation, BiSeNetFormer offers a versatile solution for multi-task segmentation. We evaluate our approach on popular datasets, Cityscapes and ADE20K, demonstrating impressive inference speeds while maintaining competitive accuracy compared to state-of-the-art architectures. Our results indicate that BiSeNetFormer represents a significant advancement towards fast, efficient, and multi-task segmentation networks, bridging the gap between model efficiency and task adaptability.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 30 references that are in the map. First posted on arXiv 15 Apr 2024.

Builds on

25 of 30 references.

References · 25

  1. 2020End-to-End Object Detection with Transformerscited by 7,414
  2. 2017Squeeze-and-Excitation Networkscited by 4,789
  3. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
  4. 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,241
  5. 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,940
  6. 2021Masked-attention Mask Transformer for Universal Image Segmentationcited by 2,351
  7. 2016V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentationcited by 2,292
  8. 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
  9. 2021Per-Pixel Classification is Not All You Need for Semantic Segmentationcited by 1,152
  10. 2018Panoptic Segmentationcited by 802
  11. 2018BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentationcited by 645
  12. 2019Panoptic-DeepLabcited by 363
13 more
  1. 2020BiSeNet V2: Bilateral Network with Guided Aggregation for Real-time Semantic Segmentationcited by 294
  2. 2019SOLO: Segmenting Objects by Locationscited by 289
  3. 2019UPSNet: A Unified Panoptic Segmentation Networkcited by 175
  4. 2021Rethinking BiSeNet For Real-time Semantic Segmentationcited by 124
  5. 2021Deep Dual-resolution Networks for Real-time and Accurate Semantic Segmentation of Road Scenescited by 89
  6. 2022PIDNet: A Real-time Semantic Segmentation Network Inspired by PID Controllerscited by 84
  7. 2023You Only Segment Once: Towards Real-Time Panoptic Segmentationcited by 40
  8. 2024PEM: Prototype-based Efficient MaskFormer for Image Segmentationcited by 36
  9. 2022PP-LiteSeg: A Superior Real-Time Semantic Segmentation Modelcited by 33
  10. 2019Real-Time Panoptic Segmentation from Dense Detectionscited by 31
  11. 2020Bidirectional Graph Reasoning Network for Panoptic Segmentationcited by 26
  12. 2019Fast Panoptic Segmentation Networkcited by 19
  13. 2022kMaX-DeepLab: k-means Mask Transformercited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.