Methods › Computer Vision › Semantic Segmentation Models › CCNet

Criss-Cross Network

CCNet

6 papers tagged archive 2025-07-28

Introduced by Zilong Huang et al. in CCNet: Criss-Cross Attention for Semantic Segmentation

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Criss-Cross Network (CCNet) aims to obtain full-image contextual information in an effective and efficient way. Concretely, for each pixel, a novel criss-cross attention module harvests the contextual information of all the pixels on its criss-cross path. By taking a further recurrent operation, each pixel can finally capture the full-image dependencies. CCNet is with the following merits: 1) GPU memory friendly. Compared with the non-local block, the proposed recurrent criss-cross attention module requires 11× less GPU memory usage. 2) High computational efficiency. The recurrent criss-cross attention significantly reduces FLOPs by about 85% of the non-local block. 3) The state-of-the-art performance.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “CCNet: Criss-Cross Attention for Semantic Segmentation” (arXiv:1811.11721, 3,083 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1811.11721: its page on this site · ask the lookup about it.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 6 · with a code link: 4 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 6 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 6 of 6, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Common Sense Reasoning1
Computational Efficiency1
Deblurring1
GPU1
Human Parsing1
Image Dehazing1
Image Restoration1
Instance Segmentation1
Object Detection1
Representation Learning1
Retrieval1
Scene Understanding1
Segmentation1
Semantic Segmentation1
Thermal Image Segmentation1
Video Segmentation1
Video Semantic Segmentation1
audio-visual event localization1
audio-visual learning1
object-detection1

Usage over time archive 2025-07-28

Papers per year tagged with CCNet: 2018 to 2025, peak 2 2 0 2018: 1 paper 2018 2019: 0 papers 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 2 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (6 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Semantic Segmentation Models

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