SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2004.02147 · 2020

BiSeNet V2: Bilateral Network with Guided Aggregation for Real-time Semantic Segmentation

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 10 functions out of this paper's own repositories and ran 7 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
gymoon10/Instance-Segmentation-with-SpatialEmbedding-CA extension 3 of 3
MaybeShewill-CV/bisenetv2-tensorflow reimplementation 2 of 2
hamidriasat/BiSeNetV2 pwc_unofficial 1 of 3
copy not recorded — 1 of 2
FunctionStatusWhere it lives
args_str2bool Ran this paper's copy was not recorded; identical code first harvested from MaybeShewill-CV/CRNN_Tensorflow
pointer only · get_code("eba8919c2ae4a92f")
calc_bd Ran gymoon10/Instance-Segmentation-with-SpatialEmbedding-CA/src/evaluation.py
pointer only (licence: NONE) · get_code("ad8c528f7eca3b49")
calc_dic Ran gymoon10/Instance-Segmentation-with-SpatialEmbedding-CA/src/evaluation.py
pointer only (licence: NONE) · get_code("1178cc4faa78d246")
calc_dice Ran gymoon10/Instance-Segmentation-with-SpatialEmbedding-CA/src/evaluation.py
pointer only (licence: NONE) · get_code("5f6d96d0e05d3612")
compute_iou Ran MaybeShewill-CV/bisenetv2-tensorflow/tools/cityscapes/test_bisenetv2_cityscapes.py
code served (permissive licence) · get_code("4c9edc2f665fa3ba")
decode_prediction_mask Ran MaybeShewill-CV/bisenetv2-tensorflow/tools/cityscapes/test_bisenetv2_cityscapes.py
code served (permissive licence) · get_code("f28994d15f099406")
stem_block Ran hamidriasat/BiSeNetV2/bisenet_v2.py
code served (permissive licence) · get_code("cda3c7e994899232")
context_embedding_block Not yet run hamidriasat/BiSeNetV2/bisenet_v2.py
code served (permissive licence) · get_code("6ecfb144dedc8a7a")
gather_and_expansion_layer Not yet run hamidriasat/BiSeNetV2/bisenet_v2.py
code served (permissive licence) · get_code("bb4d9fdc1dc610e5")
set_model_dist Not yet run this paper's copy was not recorded; identical code first harvested from CoinCheung/BiSeNet
pointer only · get_code("5c1d86977d83a6be")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The low-level details and high-level semantics are both essential to the semantic segmentation task. However, to speed up the model inference, current approaches almost always sacrifice the low-level details, which leads to a considerable accuracy decrease. We propose to treat these spatial details and categorical semantics separately to achieve high accuracy and high efficiency for realtime semantic segmentation. To this end, we propose an efficient and effective architecture with a good trade-off between speed and accuracy, termed Bilateral Segmentation Network (BiSeNet V2). This architecture involves: (i) a Detail Branch, with wide channels and shallow layers to capture low-level details and generate high-resolution feature representation; (ii) a Semantic Branch, with narrow channels and deep layers to obtain high-level semantic context. The Semantic Branch is lightweight due to reducing the channel capacity and a fast-downsampling strategy. Furthermore, we design a Guided Aggregation Layer to enhance mutual connections and fuse both types of feature representation. Besides, a booster training strategy is designed to improve the segmentation performance without any extra inference cost. Extensive quantitative and qualitative evaluations demonstrate that the proposed architecture performs favourably against a few state-of-the-art real-time semantic segmentation approaches. Specifically, for a 2,048x1,024 input, we achieve 72.6% Mean IoU on the Cityscapes test set with a speed of 156 FPS on one NVIDIA GeForce GTX 1080 Ti card, which is significantly faster than existing methods, yet we achieve better segmentation accuracy.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2004.02147")
get_code_for_paper("2004.02147")
have("2004.02147")

Connect an agent — have() is free.