Skip to content

DuSPiT: Dual-Branch Sub-Patch Pixel Diffusion Transformer

Jul 2026 · arXiv.org · Vol abs/2607.18510 · 0 citations · 28 references
Computer Science

TL;DR

The proposed DuSPiT uses a compact base branch for efficient global reasoning and a parallel, high-capacity pixel branch, organized into subpatch groups, to preserve detailed appearance, with the two branches interacting through cross-attention.

Abstract

Diffusion Transformers achieve strong image generation performance, but most operate in compressed latent spaces. Pixel-space diffusion avoids this information loss, yet existing approaches map each raw image patch to a single token, forcing one representation to handle both global communication and fine-grained details. We address this issue by proposing a new architecture, \textbf{DuSPiT}, a \textbf{Du}al-branch \textbf{S}ub\textbf{P}atch \textbf{Pi}xel \textbf{T}ransformer. This model separates global structural reasoning from local appearance modeling. DuSPiT uses a compact base branch for efficient global reasoning and a parallel, high-capacity pixel branch, organized into subpatch groups, to preserve detailed appearance, with the two branches interacting through cross-attention. Our results show that DuSPiT generates images with richer details and stronger fine-grained structures, while also achieving a better quality--efficiency trade-off than prior pixel-space diffusion transformers.

View source

Similar papers

Review Jul 2026

Pixel-Space Diffusion Transformers

Latent diffusion models (LDMs) enable efficient high-resolution image synthesis by denoising in a VAE-compressed latent space. However, fixed visual tokenizers can discard fine textures and structural details, while separate representation and diffusion training creates a mismatch between reconstruction and generation...

Ren-Ye Yan, Ji-Kang Cheng, You Wu et al. · 3 citations
Preprint Aug 2026

Bend the Basics: Degradation-Aware Deformable Tokenization for All-in-One Image Restoration

FIT employs a lightweight Degradation Encoder to predict a global degradation vector and a spatial degradation map from local degradation severity, which jointly condition the patch embedding and unembedding through adaptive deformation, and introduces a task-token dropout strategy that regularizes task conditioning du...

Zi-Hao He, Yunfeng Wu, Xinchao Wang et al. · 0 citations
Jul 2026

CUST: Clustered Unit-level Similarity Transformer for Lightweight Image Super-Resolution

The Clustered Unit-level Similarity Transformer (CUST) is proposed, a novel architecture that efficiently integrates global and local information and achieves a lower memory footprint and faster inference speed compared to recent global context or lightweight models under realistic constraints.

Jeongsook Kim · 0 citations
Preprint Aug 2026

PixelControl: Fine-Grained Condition Fidelity in Text-to-Image Diffusion

Experiments show that PixelControl improves structural fidelity and visual quality over existing controllable generation methods, with especially strong gains on boundaries and medium/small conditioned regions.

Xin Lin, Haodong Li, Zhi-Fei Zhang et al. · 1 citation
Preprint Aug 2026

PixRestore: Unified Image Restoration via Pixel Diffusion Transformer

PixRestore is presented, a VAE-free pixel-space Diffusion Transformer (DiT) for UIR, where the diffusion backbone is trained entirely from scratch, without relying on T2I pretraining.

Ling-Chen Sun, Rong-Yuan Wu, Xiang-Tao Kong et al. · 2 citations
Preprint Aug 2026

When Latents Forget Pixels: Restoring Fidelity in Diffusion Transformer Super-Resolution

This work proposes a pixel-grounded super-resolution (PGSR) framework that preserves LR-observed pixel evidence before VAE compression and reuses it throughout restoration and improves the realism--fidelity trade-off and produces more faithful, visually convincing results than existing latent generative SR approaches.

Yu Shi, Yu-Yao Zhang, Yu-Wing Tai · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.