Prototype-based Masked Cross-Attention

• The paper introduces a prototype-based masked cross-attention mechanism that selects representative prototypes to drastically reduce computation while preserving segmentation accuracy, achieving up to a 65× speed-up on Cityscapes.
• It employs a two-stage process—prototype selection and masked cross-attention—to replace dense attention in transformer-based segmentation models, supporting both semantic and panoptic segmentation.
• Empirical results highlight significant gains in panoptic quality and memory savings, with ongoing research addressing limitations like single-prototype selection and handling intra-object variation.

A prototype-based masked cross-attention mechanism is a computational paradigm for efficient image segmentation, in which cross-attention computation between pixel-level image tokens and segmentation queries is conducted via a two-stage process: (i) selection of a small set of representative prototypes from image features, and (ii) masked cross-attention between these prototypes and object queries. This mechanism is realized in the Prototype-based Efficient MaskFormer (PEM) architecture, in which prototype selection and masking enable orders-of-magnitude savings in compute and memory while preserving segmentation accuracy. The mechanism addresses the challenge of redundant full-resolution attention in transformer-based segmentation models and supports both semantic and panoptic segmentation within a unified decoding framework (Cavagnero et al., 2024).

1. Motivation and High-Level Formulation

Transformer-based segmentation architectures such as MaskFormer achieve strong performance by performing dense cross-attention between learnable object queries and all pixel-level image tokens. However, these operations incur high computational and memory requirements, which limit their scalability and applicability to resource-constrained scenarios. The prototype-based masked cross-attention mechanism addresses this by reducing the set of attended tokens: instead of performing attention over all $HW$ pixels, the model selects $N \ll HW$ prototypes—one for each query—and restricts cross-attention to these prototypes. This mechanism leverages the redundancy present in dense visual features to achieve efficiency without harming accuracy (Cavagnero et al., 2024).

2. Mathematical Formulation and Mechanism

The prototype-based masked cross-attention is defined as follows for an input image $I \in \mathbb{R}^{H \times W \times 3}$:

• Multi-scale features $F_i \in \mathbb{R}^{H_i W_i \times C}$, $i \in \{2,3,4\}$ are extracted.
• $N$ object queries $Q_{\text{in}} \in \mathbb{R}^{N \times C}$ are provided.

2.1 Linear Projections

Features and queries are linearly projected: $$X = \text{Flatten}(F_i) \in \mathbb{R}^{P \times C} \ K = X W_k \in \mathbb{R}^{P \times D} \ V = X W_v \in \mathbb{R}^{P \times D} \ Q = Q_{\text{in}} W_q \in \mathbb{R}^{N \times D}$$ where $P = H_i W_i$ and $W_k, W_v, W_q \in \mathbb{R}^{C \times D}$.

2.2 Prototype Selection

A similarity map $N \ll HW$0 is computed: $N \ll HW$1 A foreground mask $N \ll HW$2 is added to focus attention: $N \ll HW$3 For each query $N \ll HW$4, the prototype is selected by: $N \ll HW$5 Forming prototype keys and values: $N \ll HW$6

$N \ll HW$7

A binary mask $N \ll HW$8 may be constructed with $N \ll HW$9 iff $I \in \mathbb{R}^{H \times W \times 3}$0, with a soft-assignment variant also presented.

2.3 Masked Cross-Attention Computation

Instead of classical masked cross-attention

$I \in \mathbb{R}^{H \times W \times 3}$1

the prototype mechanism computes: $I \in \mathbb{R}^{H \times W \times 3}$2

$I \in \mathbb{R}^{H \times W \times 3}$3

$I \in \mathbb{R}^{H \times W \times 3}$4

$I \in \mathbb{R}^{H \times W \times 3}$5

where $I \in \mathbb{R}^{H \times W \times 3}$6 is a learnable scale parameter. This design reduces the dominant cost to $I \in \mathbb{R}^{H \times W \times 3}$7.

3. Integration into the Decoder Architecture

Within PEM, the prototype-based masked cross-attention replaces each standard masked cross-attention (CA) block in the MaskFormer decoder. At each layer $I \in \mathbb{R}^{H \times W \times 3}$8, the mechanism operates per feature scale $I \in \mathbb{R}^{H \times W \times 3}$9:

1. Project and flatten $F_i \in \mathbb{R}^{H_i W_i \times C}$0 to $F_i \in \mathbb{R}^{H_i W_i \times C}$1, $F_i \in \mathbb{R}^{H_i W_i \times C}$2, $F_i \in \mathbb{R}^{H_i W_i \times C}$3.
2. Compute similarity $F_i \in \mathbb{R}^{H_i W_i \times C}$4 and add the upsampled previous mask $F_i \in \mathbb{R}^{H_i W_i \times C}$5.
3. Select prototype indices $F_i \in \mathbb{R}^{H_i W_i \times C}$6 per query.
4. Gather $F_i \in \mathbb{R}^{H_i W_i \times C}$7, $F_i \in \mathbb{R}^{H_i W_i \times C}$8 and concatenate prototypes across scales.
5. Compute efficient prototype attention and residual updates.
6. Output the updated queries $F_i \in \mathbb{R}^{H_i W_i \times C}$9 and decoded masks $i \in \{2,3,4\}$0.

Multi-scale prototypes are merged by concatenation or averaging.

4. Computational Complexity and Efficiency

The prototype mechanism dramatically reduces compute compared to dense attention:

Mechanism	Dominant Cost	Speed-Up Factor
Full cross-attention	$i \in \{2,3,4\}$1	—
Prototype-based PEM-CA	$i \in \{2,3,4\}$2	$i \in \{2,3,4\}$3 at large $i \in \{2,3,4\}$4

For example, on Cityscapes F2 ($i \in \{2,3,4\}$5, $i \in \{2,3,4\}$6), a $i \in \{2,3,4\}$7 speed-up is observed (Cavagnero et al., 2024). Memory savings are also significant, as only $i \in \{2,3,4\}$8 is stored, not the full $i \in \{2,3,4\}$9 self-attention map.

5. Empirical Results and Ablations

Ablations on Cityscapes with ResNet-50 demonstrate:

• Removing prototype selection reduces panoptic quality (PQ) from $N$0 to $N$1 ($N$2).
• Removing masking reduces PQ to $N$3 ($N$4).
• Varying $N$5 shows performance saturates at $N$6.
• Increasing decoder layers (e.g., from $N$7 to $N$8) yields diminishing returns, small latency increase.

These results indicate that prototype selection is indispensable for instance discrimination. Masking is critical for foreground focus, and the count $N$9 trades off compute for accuracy, but improvement saturates quickly above $Q_{\text{in}} \in \mathbb{R}^{N \times C}$0 (Cavagnero et al., 2024).

6. Limitations and Open Research Directions

The current prototype mechanism selects a single pixel prototype per object, which may be insufficient for capturing intra-object variation, especially in large or non-convex regions. Leveraging multiple prototypes per object is an open research direction. Selection is based on previous layer masks, so error propagation can occur if masks are poor—soft-assignment or iterative refinement may mitigate this. Prototype selection via $Q_{\text{in}} \in \mathbb{R}^{N \times C}$1 is non-differentiable, necessitating straight-through gradient estimators; fully differentiable selection (e.g., Gumbel-softmax) remains unexplored. Currently, prototype-based attention handles one object per query, so dynamic query management for variable object counts is future work (Cavagnero et al., 2024).