针对语义分割的冗余特征剪枝方法,提升模型效率与精度。
Structural Pruning via Spatial-aware Information Redundancy for Semantic Segmentation
- 基于图论构建最大边权团问题,优化通道间冗余去除。
- 引入空间感知冗余度量,使剪枝更适应位置敏感的分割任务。
- 提出低复杂度贪心策略,高效求解剪枝问题,适合实际部署。
近年来,语义分割在众多应用中蓬勃发展,但高计算成本仍是阻碍其广泛采用的主要挑战。针对结构化网络瘦身的滤波器剪枝方法为降低分割网络开销提供了直接有效的解决方案。然而,我们指出,多数现有剪枝方法最初为图像分类设计,忽视了分割任务对位置敏感的特性,导致应用于分割网络时性能不佳。为此,本文提出一种新方法——空间感知信息冗余剪枝(SIRFP),旨在减少通道间的特征冗余。首先,将剪枝过程建模为图论中的最大边权团问题(MEWCP),以最小化剪枝后剩余特征的冗余。在此框架下,基于特征图引入空间感知冗余度量,赋予剪枝过程位置敏感性,更好地适配分割网络。此外,基于MEWCP,提出一种低计算复杂度的贪心策略,有效求解该NP难问题,实现高效且可行的结构化剪枝。为验证方法有效性,我们在多个具有挑战性的数据集上进行了大量对比实验,结果表明SIRFP在语义分割任务中表现优越。
原文摘要 · Abstract (English)
In recent years, semantic segmentation has flourished in various applications. However, the high computational cost remains a significant challenge that hinders its further adoption. The filter pruning method for structured network slimming offers a direct and effective solution for the reduction of segmentation networks. Nevertheless, we argue that most existing pruning methods, originally designed for image classification, overlook the fact that segmentation is a location-sensitive task, which consequently leads to their suboptimal performance when applied to segmentation networks. To address this issue, this paper proposes a novel approach, denoted as Spatial-aware Information Redundancy Filter Pruning~(SIRFP), which aims to reduce feature redundancy between channels. First, we formulate the pruning process as a maximum edge weight clique problem~(MEWCP) in graph theory, thereby minimizing the redundancy among the remaining features after pruning. Within this framework, we introduce a spatial-aware redundancy metric based on feature maps, thus endowing the pruning process with location sensitivity to better adapt to pruning segmentation networks. Additionally, based on the MEWCP, we propose a low computational complexity greedy strategy to solve this NP-hard problem, making it feasible and efficient for structured pruning. To validate the effectiveness of our method, we conducted extensive comparative experiments on various challenging datasets. The results demonstrate the superior performance of SIRFP for semantic segmentation tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。