Methods › General › Attention Mechanisms › GCT

Gated Channel Transformation

GCT

8 papers tagged archive 2025-07-28

Introduced by Zongxin Yang et al. in Gated Channel Transformation for Visual Recognition

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

GCT first collects global information by computing the l2-norm of each channel. Next, a learnable vector α is applied to scale the feature. Then a competition mechanism is adopted by channel normalization to interact between channels.

Unlike previous methods, GCT first collects global information by computing the l₂-norm of each channel. Next, a learnable vector α is applied to scale the feature. Then a competition mechanism is adopted by channel normalization to interact between channels. Like other common normalization methods, a learnable scale parameter γ and bias β are applied to rescale the normalization. However, unlike previous methods, GCT adopts tanh activation to control the attention vector. Finally, it not only multiplies the input by the attention vector but also adds an identity connection. GCT can be written as: s = F_(gct)(X, θ) = tanh(γCN(αNorm(X)) + β) Y = s X + X

where α, β and γ are trainable parameters. Norm(·) indicates the L2-norm of each channel. CN is channel normalization.

A GCT block has fewer parameters than an SE block, and as it is lightweight, can be added after each convolutional layer of a CNN.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: GCT-MARL.

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: 8 · with a code link: 2 · 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 8 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 8 of 8, 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

19 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
Object Detection3
object-detection3
Image Classification2
Instance Segmentation2
Semantic Segmentation2
image-classification2
Classification1
Co-Salient Object Detection1
Few-Shot Learning1
General Classification1
Graph Learning1
Graph Neural Network1
Object1
Prediction1
Salient Object Detection1
Self-Supervised Learning1
Time Series Analysis1
Traffic Prediction1
Video Classification1

Usage over time archive 2025-07-28

Papers per year tagged with GCT: 2019 to 2024, peak 3 3 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 3 papers 2022 2023: 0 papers 2023 2024: 3 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (8 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

Attention Mechanisms

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