Papers › Collaborative Global-Local Networks for Memory-Efficient Segmentation of Ultra-High...

Collaborative Global-Local Networks for Memory-Efficient Segmentation of Ultra-High Resolution Images

15 May 2019CVPR 2019 6arXiv:1905.06368archive 2025-07-28

Wuyang Chen, Ziyu Jiang, Zhangyang Wang, Kexin Cui, Xiaoning Qian

Segmentation of ultra-high resolution images is increasingly demanded, yet poses significant challenges for algorithm efficiency, in particular considering the (GPU) memory limits. Current approaches either downsample an ultra-high resolution image or crop it into small patches for separate processing. In either way, the loss of local fine details or global contextual information results in limited segmentation accuracy. We propose collaborative Global-Local Networks (GLNet) to effectively preserve both global and local information in a highly memory-efficient manner. GLNet is composed of a global branch and a local branch, taking the downsampled entire image and its cropped local patches as respective inputs. For segmentation, GLNet deeply fuses feature maps from two branches, capturing both the high-resolution fine structures from zoomed-in local patches and the contextual dependency from the downsampled input. To further resolve the potential class imbalance problem between background and foreground regions, we present a coarse-to-fine variant of GLNet, also being memory-efficient. Extensive experiments and analyses have been performed on three real-world ultra-high aerial and medical image datasets (resolution up to 30 million pixels). With only one single 1080Ti GPU and less than 2GB memory used, our GLNet yields high-quality segmentation results and achieves much more competitive accuracy-memory usage trade-offs compared to state-of-the-arts.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.06368")

Code

Syntology Ran 2 of 17 code samples harvested from 1 repository linked to this paper; 15 have no recorded run. Of those that ran: 1 ran · violated contract; 1 ran · our draft was wrong.

By repository: official repository: 17 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

chenwydj/ultra_high_resolution_segmentation officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 2 ran; 0 honoured the contract we drafted; 15 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
1ran · our draft was wrong
15unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from chenwydj/ultra_high_resolution_segmentation. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

conv3x3 chenwydj/ultra_high_resolution_segmentation/models/resnet_dilation.py official repository ran · our draft was wrong MIT (permissive) · fac5364e2f53c6db · report
lovasz_grad chenwydj/ultra_high_resolution_segmentation/utils/lovasz_losses.py official repository ran · violated contract fingerprinted MIT (permissive) · e85b5d21dc5b8382 · report
RGB_mapping_to_class chenwydj/ultra_high_resolution_segmentation/dataset/deep_globe.py official repository unverified MIT (permissive) · 83164b90f29b12b6 · report
find_label_map_name chenwydj/ultra_high_resolution_segmentation/dataset/deep_globe.py official repository unverified MIT (permissive) · 88571e0bc1f87c4c · report
get_model_file chenwydj/ultra_high_resolution_segmentation/models/model_store.py official repository unverified MIT (permissive) · 5aca26e2a8b0f1a0 · report
images_transform chenwydj/ultra_high_resolution_segmentation/helper.py official repository unverified MIT (permissive) · fee7ad2e9af58d46 · report
iou chenwydj/ultra_high_resolution_segmentation/utils/lovasz_losses.py official repository unverified MIT (permissive) · 3d751ab2b52adb8f · report
iou_binary chenwydj/ultra_high_resolution_segmentation/utils/lovasz_losses.py official repository unverified MIT (permissive) · 0fc87425bc96807d · report
is_image_file chenwydj/ultra_high_resolution_segmentation/dataset/deep_globe.py official repository unverified MIT (permissive) · 0516d5020cce56da · report
masks_transform chenwydj/ultra_high_resolution_segmentation/helper.py official repository unverified MIT (permissive) · ef246a258385aff1 · report
one_hot chenwydj/ultra_high_resolution_segmentation/utils/loss.py official repository unverified MIT (permissive) · 75fbeebf4d62eccd · report
resize chenwydj/ultra_high_resolution_segmentation/helper.py official repository unverified MIT (permissive) · 31b90680f5041dcc · report
resnet101 chenwydj/ultra_high_resolution_segmentation/models/resnet.py official repository unverified MIT (permissive) · c7423f05f117cdcb · report
resnet18 chenwydj/ultra_high_resolution_segmentation/models/resnet_dilation.py official repository unverified MIT (permissive) · b170e2d6a36d1f07 · report
resnet34 chenwydj/ultra_high_resolution_segmentation/models/resnet_dilation.py official repository unverified MIT (permissive) · 27ca382809ba86cf · report
resnet50 chenwydj/ultra_high_resolution_segmentation/models/resnet.py official repository unverified MIT (permissive) · 8d58c0005a32eac6 · report
short_hash chenwydj/ultra_high_resolution_segmentation/models/model_store.py official repository unverified MIT (permissive) · 2dcd89bf466544aa · report

Tasks

Land Cover ClassificationSegmentationSemantic Segmentation

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections