通过跨层缓存恢复低保留率下的细粒度图像识别信息
Cross-Layer Cache Aggregation for Token Reduction in Ultra-Fine-Grained Image Recognition
- 设计跨层聚合分类头与缓存机制,从深层回溯早期特征
- 在仅保留10%令牌时仍保持媲美顶尖模型的准确率
- 适配多种骨干网络与降采样方法,可即插即用
超细粒度图像识别(UFGIR)需对同一物种内的子类别(如植物品种)进行分类,挑战性远高于传统细粒度识别。尽管基于视觉变换器的模型在该任务上表现优异,但高分辨率输入带来巨大计算开销。为此,令牌压缩技术被广泛采用以降低计算成本,但过度丢弃令牌会损失关键判别信息。为此,本文提出一种跨层聚合分类头和跨层缓存机制,可在后续层中恢复并访问早期层的信息。在5个数据集、9种骨干网络、7种令牌压缩方法、5种保留率及2种图像尺寸下,共开展超过2000次实验验证。结果表明,所提模块具有强泛化能力,可将令牌保留率降至最低10%,同时维持与当前最优模型相当的精度,显著提升精度与效率的平衡。代码已开源。
原文摘要 · Abstract (English)
Ultra-fine-grained image recognition (UFGIR) is a challenging task that involves classifying images within a macro-category. While traditional FGIR deals with classifying different species, UFGIR goes beyond by classifying sub-categories within a species such as cultivars of a plant. In recent times the usage of Vision Transformer-based backbones has allowed methods to obtain outstanding recognition performances in this task but this comes at a significant cost in terms of computation specially since this task significantly benefits from incorporating higher resolution images. Therefore, techniques such as token reduction have emerged to reduce the computational cost. However, dropping tokens leads to loss of essential information for fine-grained categories, specially as the token keep rate is reduced. Therefore, to counteract the loss of information brought by the usage of token reduction we propose a novel Cross-Layer Aggregation Classification Head and a Cross-Layer Cache mechanism to recover and access information from previous layers in later locations. Extensive experiments covering more than 2000 runs across diverse settings including 5 datasets, 9 backbones, 7 token reduction methods, 5 keep rates, and 2 image sizes demonstrate the effectiveness of the proposed plug-and-play modules and allow us to push the boundaries of accuracy vs cost for UFGIR by reducing the kept tokens to extremely low ratios of up to 10\% while maintaining a competitive accuracy to state-of-the-art models. Code is available at: \url{https://github.com/arkel23/CLCA}
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。