We lifted 3 functions out of this paper's own repositories and ran 2 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.
| Repository | Role | Ran |
|---|---|---|
| MendelXu/ANN | canonical | 2 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| filter_blank | Ran | MendelXu/ANN/efficiency_statics/time_detail.py code served (permissive licence) · get_code("7fd072abd1119b66") |
| filter_end | Ran | MendelXu/ANN/efficiency_statics/time_detail.py code served (permissive licence) · get_code("0ac25e4d5f6ee159") |
| test | Not yet run | MendelXu/ANN/efficiency_statics/time_detail.py code served (permissive licence) · get_code("bd8478b90ca0fa11") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The non-local module works as a particularly useful technique for semantic segmentation while criticized for its prohibitive computation and GPU memory occupation. In this paper, we present Asymmetric Non-local Neural Network to semantic segmentation, which has two prominent components: Asymmetric Pyramid Non-local Block (APNB) and Asymmetric Fusion Non-local Block (AFNB). APNB leverages a pyramid sampling module into the non-local block to largely reduce the computation and memory consumption without sacrificing the performance. AFNB is adapted from APNB to fuse the features of different levels under a sufficient consideration of long range dependencies and thus considerably improves the performance. Extensive experiments on semantic segmentation benchmarks demonstrate the effectiveness and efficiency of our work. In particular, we report the state-of-the-art performance of 81.3 mIoU on the Cityscapes test set. For a 256x128 input, APNB is around 6 times faster than a non-local block on GPU while 28 times smaller in GPU running memory occupation. Code is available at: https://github.com/MendelXu/ANN.git.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1908.07678")
get_code_for_paper("1908.07678")
have("1908.07678")
Connect an agent — have() is free.