Learning to Rank Patches for Unbiased Image Redundancy Reduction
Not on the map. Why?
Abstract (arXiv)
Images suffer from heavy spatial redundancy because pixels in neighboring regions are spatially correlated. Existing approaches strive to overcome this limitation by reducing less meaningful image regions. However, current leading methods rely on supervisory signals. They may compel models to preserve content that aligns with labeled categories and discard content belonging to unlabeled categories. This categorical inductive bias makes these methods less effective in real-world scenarios. To address this issue, we propose a self-supervised framework for image redundancy reduction called Learning to Rank Patches (LTRP). We observe that image reconstruction of masked image modeling models is sensitive to the removal of visible patches when the masking ratio is high (e.g., 90%). Building upon it, we implement LTRP via two steps: inferring the semantic density score of each patch by quantifying variation between reconstructions with and without this patch, and learning to rank the patches with the pseudo score. The entire process is self-supervised, thus getting out of the dilemma of categorical inductive bias. We design extensive experiments on different datasets and tasks. The results demonstrate that LTRP outperforms both supervised and other self-supervised methods due to the fair assessment of image content.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 30 of its 51 references that are in the map. First posted on arXiv 31 Mar 2024.
Builds on
30 of 51 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2022Generative Adversarial Networkscited by 5,603
- 2015Learning Deep Features for Discriminative Localizationcited by 2,430
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
- 2021SimMIM: A Simple Framework for Masked Image Modelingcited by 1,147
- 2022Token Merging: Your ViT But Fastercited by 995
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
18 more
- 2021Masked Feature Prediction for Self-Supervised Visual Pre-Trainingcited by 573
- 2022GroupViT: Semantic Segmentation Emerges from Text Supervisioncited by 529
- 2020Asymmetric Loss For Multi-Label Classificationcited by 379
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 360
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 359
- 2018Learning Pixel-level Semantic Affinity with Image-level Supervision for Weakly Supervised Semantic Segmentationcited by 321
- 2021Mobile-Former: Bridging MobileNet and Transformercited by 234
- 2021AdaViT: Adaptive Vision Transformers for Efficient Image Recognitioncited by 228
- 2017RankIQA: Learning from Rankings for No-reference Image Quality Assessmentcited by 150
- 2020Resolution Adaptive Networks for Efficient Inferencecited by 146
- 2020Glance and Focus: a Dynamic Approach to Reducing Spatial Redundancy in Image Classificationcited by 99
- 2022Contrastive Learning Rivals Masked Image Modeling in Fine-tuning via Feature Distillationcited by 93
- 2021ML-Decoder: Scalable and Versatile Classification Headcited by 78
- 2021Differentiable Patch Selection for Image Recognitioncited by 68
- 2022Crafting Better Contrastive Views for Siamese Representation Learningcited by 67
- 2022Learning to Merge Tokens in Vision Transformerscited by 64
- 2023Dynamic Grained Encoder for Vision Transformerscited by 24
- 2023Improving Pixel-based MIM by Reducing Wasted Modeling Capabilitycited by 24
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025Sparse Imagination for Efficient Visual World Model Planningcited by 7
- 2025LookWhere? Efficient Visual Recognition by Learning Where to Look and What to See from Self-Supervisioncited by 5
- 2025Diversity-Guided MLP Reduction for Efficient Large Vision Transformerscited by 3
- 2026Adaptive MLP Pruning for Large Vision Transformerscited by 2
- 2026Grad-CAM for Vision Transformers: A Systematic Taxonomy and Audit of Methodological Ambiguity in Explainable AIcited by 0
- 2026LookThere! Sparse Vision by Reinforced Selectioncited by 0
- 2026LookThere! Sparse Vision by Reinforced Selection4 Sep 2026
- 2026Grad-CAM for Vision Transformers: A Systematic Taxonomy and Audit of Methodological Ambiguity in Explainable AI5 Aug 2026
- 2026Adaptive MLP Pruning for Large Vision Transformers9 Mar 2026
- 2025Diversity-Guided MLP Reduction for Efficient Large Vision Transformers10 Jun 2025
- 2025Sparse Imagination for Efficient Visual World Model Planning2 Jun 2025
- 2025LookWhere? Efficient Visual Recognition by Learning Where to Look and What to See from Self-Supervision23 May 2025