Scan-and-Print: Patch-level Data Summarization and Augmentation for Content-aware Layout Generation in Poster Design
Not on the map. Why?
Abstract (arXiv)
In AI-empowered poster design, content-aware layout generation is crucial for the on-image arrangement of visual-textual elements, e.g., logo, text, and underlay. To perceive the background images, existing work demanded a high parameter count that far exceeds the size of available training data, which has impeded the model's real-time performance and generalization ability. To address these challenges, we proposed a patch-level data summarization and augmentation approach, vividly named Scan-and-Print. Specifically, the scan procedure selects only the patches suitable for placing element vertices to perform fine-grained perception efficiently. Then, the print procedure mixes up the patches and vertices across two image-layout pairs to synthesize over 100% new samples in each epoch while preserving their plausibility. Besides, to facilitate the vertex-level operations, a vertex-based layout representation is introduced. Extensive experimental results on widely used benchmarks demonstrated that Scan-and-Print can generate visually appealing layouts with state-of-the-art quality while dramatically reducing computational bottleneck by 95.2%.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
29 of 40 references.
References · 29
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2023BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Modelscited by 6,069
- 2023Adding Conditional Control to Text-to-Image Diffusion Modelscited by 5,466
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2023MiniGPT-4: Enhancing Vision-Language Understanding with Advanced Large Language Modelscited by 2,689
- 2023Code Llama: Open Foundation Models for Codecited by 2,105
- 2020YOLOv4: Optimal Speed and Accuracy of Object Detectioncited by 1,624
- 2022DeiT III: Revenge of the ViTcited by 417
- 2023DreamSim: Learning New Dimensions of Human Visual Similarity using Synthetic Datacited by 322
17 more
- 2020Puzzle Mix: Exploiting Saliency and Local Statistics for Optimal Mixupcited by 260
- 2020SaliencyMix: A Saliency Guided Data Augmentation Strategy for Better Regularizationcited by 149
- 2023LayoutDM: Discrete Diffusion Model for Controllable Layout Generationcited by 141
- 2021Co-Mixup: Saliency Guided Joint Mixup with Supermodular Diversitycited by 127
- 2022Highly Accurate Dichotomous Image Segmentationcited by 110
- 2020Attribute-conditioned Layout GAN for Automatic Graphic Designcited by 67
- 2023PosterLayout: A New Benchmark and Approach for Content-aware Visual-Textual Presentation Layoutcited by 60
- 2022Composition-aware Graphic Layout GAN for Visual-textual Presentation Designscited by 59
- 2023LayoutDM: Transformer-based Diffusion Model for Layout Generationcited by 57
- 2023AutoPoster: A Highly Automatic and Content-aware Design System for Advertising Poster Generationcited by 41
- 2021SSMix: Saliency-Based Span Mixup for Text Classificationcited by 39
- 2023Retrieval-Augmented Layout Transformer for Content-Aware Layout Generationcited by 34
- 2024PosterLlama: Bridging Design Ability of Langauge Model to Contents-Aware Layout Generationcited by 34
- 2022Geometry Aligned Variational Transformer for Image-conditioned Layout Generationcited by 33
- 2023GuidedMixup: An Efficient Mixup Strategy Guided by Saliency Mapscited by 23
- 2024Desigen: A Pipeline for Controllable Design Template Generationcited by 19
- 2023Unsupervised Domain Adaption with Pixel-level Discriminator for Image-aware Layout Generationcited by 13
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.