Shifted Patch Tokenization (SPT) in Vision Transformers

• Shifted Patch Tokenization (SPT) is an embedding technique that aggregates overlapping spatial information from shifted image views to enhance locality in Vision Transformers.
• It increases the effective receptive field without altering the self-attention mechanism, making it effective for low-level vision tasks and small-data regimes.
• Empirical results show SPT boosts classification accuracy by up to 3.60% on Tiny-ImageNet and improves restoration metrics in tasks like denoising and inpainting.

Shifted Patch Tokenization (SPT) is an embedding technique designed to augment the locality bias and receptive field of patch-based Transformer architectures, especially Vision Transformers (ViT), by aggregating overlapping spatial information from shifted versions of the input. SPT addresses inherent deficiencies of standard non-overlapping patch tokenization—namely, the limited context captured by each token and the resulting inductive bias mismatch for low-level vision or small-data regimes. The approach enhances both model data efficiency and downstream task performance by directly integrating cross-patch spatial structures at the embedding stage, without modifying the self-attention mechanism or overall Transformer architecture (Lee et al., 2021, Verma et al., 2023).

1. Motivation and Underlying Principles

Standard ViT tokenization slices an image $I \in \mathbb{R}^{H \times W \times C}$ into non-overlapping $P \times P$ patches, each of which is flattened and linearly projected. This arrangement provides each token with information from a strictly local $P \times P$ region without access to spatially adjacent pixels, leading to the following limitations:

• Limited local receptive field per token and no shared pixels across tokens, resulting in weak inductive locality bias.
• The burden of learning local structures is transferred entirely to the Transformer’s self-attention, which is inefficient for small datasets or low-level vision tasks.

SPT addresses these deficits by introducing redundancy and spatial overlap at the tokenization step. By generating and concatenating several shifted versions of the input image (each displaced by a pre-defined offset), SPT allows each patch token to aggregate information from overlapping spatial neighborhoods. This approach raises the effective receptive field of each token and breaks the rigid partitioning boundaries present in vanilla ViT, enabling local continuity in the learned representations (Lee et al., 2021, Verma et al., 2023).

2. Mathematical Formulation

Let $I \in \mathbb{R}^{H \times W \times C}$ denote the input. Define a set of $N_s$ shifts with offsets $\{\delta_i\}_{i=1}^{N_s}$, such as diagonal or cardinal directions, with shift size typically $P/2$. For each offset $\delta$:

$$I^{(\delta)} = \mathrm{CropPad}\bigl(\mathrm{Shift}(I,\,\delta)\bigr)$$

All shifted images, along with the unshifted $I$, are concatenated channel-wise:

$P \times P$0

This augmented tensor is partitioned into non-overlapping $P \times P$1 patches, each flattened to a vector $P \times P$2. Each vector passes through LayerNorm and a learned projection $P \times P$3:

$P \times P$4

The set $P \times P$5 forms the token sequence fed into the Transformer encoder. This procedure generalizes to internal pooling/token-merging layers by reshaping token maps and reapplying SPT (Lee et al., 2021, Verma et al., 2023).

3. Implementation and Hyperparameters

Typical SPT settings, empirically validated in multiple studies, include:

• Number of Shifts $P \times P$6: Four, in either diagonal or cardinal directions.
• Shift Magnitude: $P \times P$7 (half the patch size).
• Padding Mode: Zero-padding out-of-bounds pixels after shifting.
• Channel-Concatenation Factor: $P \times P$8, e.g., factor of $P \times P$9 for four shifts.
• Projection Dimension $P \times P$0: Matches the ViT hidden size, e.g., $P \times P$1, $P \times P$2.
• Patch Size $P \times P$3: Depends on downstream task; $P \times P$4 for standard ViT, $P \times P$5 for small datasets.
• Shift Operator: Either circular or zero-padding, depending on experiment.

The following table summarizes these core parameters:

Hyperparameter	Typical Value	Description
Number of shifts	4	Directions: Diagonal or Cardinal
Shift magnitude	$P \times P$6	Pixels per shift
Channel Factor	5	$P \times P$7 for four shifts
Padding	Zero	Out-of-bounds handling

4. Algorithmic Steps and Pseudocode

The essential algorithm is as follows (Verma et al., 2023, Lee et al., 2021):

$P/2$1

This function generalizes to any $P \times P$8, patch size $P \times P$9, and embedding dimension $I \in \mathbb{R}^{H \times W \times C}$0.

5. Empirical Results and Ablations

SPT consistently delivers measurable improvements over baseline ViT across both low-level vision and small-scale classification datasets. Selected findings:

• Tiny-ImageNet (64×64 grayscale), no discriminator (Verma et al., 2023):
  • Denoising: PSNR improves from $I \in \mathbb{R}^{H \times W \times C}$1 to $I \in \mathbb{R}^{H \times W \times C}$2; SSIM from $I \in \mathbb{R}^{H \times W \times C}$3 to $I \in \mathbb{R}^{H \times W \times C}$4; NMSE falls from $I \in \mathbb{R}^{H \times W \times C}$5 to $I \in \mathbb{R}^{H \times W \times C}$6.
  • Inpainting: PSNR improves from $I \in \mathbb{R}^{H \times W \times C}$7 to $I \in \mathbb{R}^{H \times W \times C}$8; SSIM from $I \in \mathbb{R}^{H \times W \times C}$9 to $N_s$0; NMSE from $N_s$1 to $N_s$2.
  • With adversarial loss, PSNR is further improved by $N_s$3 (denoising) and $N_s$4 (inpainting) over ViT+GAN.
• Classification on CIFAR-100 and Tiny-ImageNet (Lee et al., 2021):
  • CIFAR-100: Baseline ViT $N_s$5 top-1 $N_s$6 $N_s$7 with SPT ($N_s$8).
  • Tiny-ImageNet: Baseline ViT $N_s$9 top-1 $\{\delta_i\}_{i=1}^{N_s}$0 $\{\delta_i\}_{i=1}^{N_s}$1 with SPT ($\{\delta_i\}_{i=1}^{N_s}$2).
  • SPT yields $\{\delta_i\}_{i=1}^{N_s}$3–$\{\delta_i\}_{i=1}^{N_s}$4 on ImageNet.

A plausible implication is that SPT effectively mitigates data inefficiency and locality bias without incurring substantial computational overhead at scale.

6. Computational Complexity and System Integration

Each shifted view increases the input channel dimension, expanding the pre-projection embedding by a factor of $\{\delta_i\}_{i=1}^{N_s}$5. This results in:

• Memory/Compute Overhead:
  • Patch embedding layer’s input grows linearly with $\{\delta_i\}_{i=1}^{N_s}$6, i.e., for $\{\delta_i\}_{i=1}^{N_s}$7, a $\{\delta_i\}_{i=1}^{N_s}$8 increase in pre-projection dimensionality.
  • Wall-clock and FLOPs: Patch embedding’s increased cost remains a minor fraction compared to attention and feedforward layers (Verma et al., 2023, Lee et al., 2021).
  • Temporary memory for concatenated feature maps.
• Integration:
  • SPT is a drop-in replacement for standard ViT’s patch embedding, requiring no changes to downstream positional encodings, self-attention, or head structure.
  • Identical application to internal pooling or merging layers in hierarchical transformers (e.g., Swin, PiT).

7. Use Cases, Benefits, and Practical Recommendations

SPT is empirically shown to be most beneficial in these settings:

• Transformers trained from scratch on small or medium datasets, where locality bias compensates for the lack of pretraining data.
• Low-level, pixel-based vision tasks (denoising, inpainting) requiring preservation of fine spatial structures.
• As a minimal architectural tweak, SPT is easily adoptable in any ViT family or patch-based model without requiring custom self-attention or nonstandard pooling.

Because SPT only modifies tokenization and marginally increases patch embedding cost, and because it yields consistent accuracy gains of $\{\delta_i\}_{i=1}^{N_s}$9–$P/2$0 (classification) and measurable gains in PSNR/SSIM (restoration), it is recommended wherever locality bias is desirable but architectural simplicity and computational efficiency are priorities (Lee et al., 2021, Verma et al., 2023).