arXiv Computer Vision
MixTok: Adaptive Visual Tokenization with Global 1D Tokens and Sparse 2D Refinement
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
Hugging Face Trending Papers
Sep 29
NesTok: Nested Self-Aligned 1D Tokenizer for Autoregressive Image Generation
One-dimensional (1D) variable-length visual tokenizers enable adaptive compression by varying the number of tokens, allowing downstream autoregressive (AR) models to flexibly trade off generation qual...
arXiv AI
Sep 30
NesTok: Nested Self-Aligned 1D Tokenizer for Autoregressive Image Generation
arXiv:2609.36756v1 Announce Type: cross Abstract: One-dimensional (1D) variable-length visual tokenizers enable adaptive compression by varying the number of tokens, allowing downstream autoregressiv...
arXiv Computer Vision
5d ago
QuadTok: Quadtree Visual Tokenizer for Autoregressive Image Generation
QuadTok introduces a quadtree-based visual tokenizer that replaces traditional 2D grids or 1D token sequences with a hierarchical structure, allowing dynamic allocation of tokens to visually complex regions while using coarser resolution for homogeneous areas. The tokenizer, trained on ImageNet, reduces token usage by about 10% compared to a fixed 256-token grid and retains comparable reconstruction fidelity. Leveraging the tree’s natural causality, a 947 M GPT-style model conditioned on a quadtree topology achieves a 2.08 gFID on ImageNet 256×256 and supports zero‑shot spatially controlled image generation.
arXiv Computer Vision
4d ago
BudgetPix: Compute-Adaptive Tokenization for Pixel-Space Image Diffusion
BudgetPix introduces a compute‑adaptive tokenization framework for pixel‑space image diffusion, dynamically allocating computational resources based on visual complexity and spatial layout. It comprises an adaptive encoder using an entropy‑guided quadtree and multi‑scale patch embedder, a scale‑aware decoder, and a flexible training schedule that allows pixel‑space denoisers to operate across variable token counts. The method integrates with existing diffusion architectures, achieving comparable fidelity to larger models while using only a fraction of the compute budget, and demonstrates improved quality‑efficiency tradeoffs in both text‑to‑image and class‑conditional generation.
arXiv Computer Vision
Aug 25
Adaptive Tokenisation Via Temporal Redundancy Masking And Latent Inpainting
arXiv:2606.06158v2 Announce Type: replace Abstract: Adaptive video tokenisation seeks to dynamically allocate token budgets based on the underlying visual complexity of a sequence. Current continuous...
arXiv Machine Learning
Jun 5
Balancing Image Compression and Generation with Bootstrapped Tokenization
arXiv:2606. 05552v1 Announce Type: new Abstract: Despite progress in image tokenization, standard methods encode redundant information by mixing all granularities within each token, thus redundancy persists between tokens.