组内邻域关系感知的通道修剪

IF 3 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Yu Pan, Ning Chen, Hongqing Zhu, Zhiying Zhu
{"title":"组内邻域关系感知的通道修剪","authors":"Yu Pan,&nbsp;Ning Chen,&nbsp;Hongqing Zhu,&nbsp;Zhiying Zhu","doi":"10.1016/j.dsp.2025.105615","DOIUrl":null,"url":null,"abstract":"<div><div>The high computational and memory requirements of Convolutional Neural Networks (CNNs) limit the deployment of CNN-based image processing models on edge computing devices. To this end, the clustering-based structural pruning methods have been studied to prune the redundant channels. However, the conventional clustering-based pruning methods may not achieve satisfactory performances for the following reasons. First, the clustering is performed only based on the feature of the current layer, which is not enough to identify the importance of each channel precisely. Second, the K-Means or K-Means++ clustering-based pruning methods may be affected by abnormal channels easily. Third, the strategy of pruning the channels around centroids may prune important channels. Fourth, the number of clusters needs to be set manually, which may affect the flexibility and generalization. To solve these issues, an intro-group neighborhood relationship-aware (IGNRA) channel pruning method is proposed. First, DepGraph is adopted to construct the dependency graph, based on which the global-level importance of each channel is assessed. Second, K-Medoids is adopted to perform clustering to reduce the influence of abnormal channels. Third, the centroids of clusters with multiple channels are viewed as redundant channels and pruned directly, while the centroids of those with a single channel are retained due to their unique roles in the downstream tasks. Fourth, the number of the clusters is set according to the pruning ratio automatically to enhance the method’s flexibility and generalization. Extensive experimental results on 9 models for two image processing tasks on 6 datasets demonstrate that the proposed method outperforms the state-of-the-art pruning methods, and each key module contributes to the performance enhancement.</div></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"168 ","pages":"Article 105615"},"PeriodicalIF":3.0000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intra-group neighborhood relationship-aware channel pruning\",\"authors\":\"Yu Pan,&nbsp;Ning Chen,&nbsp;Hongqing Zhu,&nbsp;Zhiying Zhu\",\"doi\":\"10.1016/j.dsp.2025.105615\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The high computational and memory requirements of Convolutional Neural Networks (CNNs) limit the deployment of CNN-based image processing models on edge computing devices. To this end, the clustering-based structural pruning methods have been studied to prune the redundant channels. However, the conventional clustering-based pruning methods may not achieve satisfactory performances for the following reasons. First, the clustering is performed only based on the feature of the current layer, which is not enough to identify the importance of each channel precisely. Second, the K-Means or K-Means++ clustering-based pruning methods may be affected by abnormal channels easily. Third, the strategy of pruning the channels around centroids may prune important channels. Fourth, the number of clusters needs to be set manually, which may affect the flexibility and generalization. To solve these issues, an intro-group neighborhood relationship-aware (IGNRA) channel pruning method is proposed. First, DepGraph is adopted to construct the dependency graph, based on which the global-level importance of each channel is assessed. Second, K-Medoids is adopted to perform clustering to reduce the influence of abnormal channels. Third, the centroids of clusters with multiple channels are viewed as redundant channels and pruned directly, while the centroids of those with a single channel are retained due to their unique roles in the downstream tasks. Fourth, the number of the clusters is set according to the pruning ratio automatically to enhance the method’s flexibility and generalization. Extensive experimental results on 9 models for two image processing tasks on 6 datasets demonstrate that the proposed method outperforms the state-of-the-art pruning methods, and each key module contributes to the performance enhancement.</div></div>\",\"PeriodicalId\":51011,\"journal\":{\"name\":\"Digital Signal Processing\",\"volume\":\"168 \",\"pages\":\"Article 105615\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2025-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digital Signal Processing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1051200425006372\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1051200425006372","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

卷积神经网络(cnn)对计算和内存的高要求限制了基于cnn的图像处理模型在边缘计算设备上的部署。为此,研究了基于聚类的结构剪枝方法对冗余信道进行剪枝。然而,由于以下原因,传统的基于聚类的剪枝方法可能无法达到令人满意的性能。首先,仅根据当前层的特征进行聚类,这不足以精确识别每个通道的重要性。其次,基于K-Means或k - means++聚类的剪枝方法容易受到异常通道的影响。第三,修剪质心周围通道的策略可能会修剪重要通道。第四,需要手动设置簇数,这可能会影响灵活性和泛化。为了解决这些问题,提出了一种引入群邻域关系感知(IGNRA)信道剪枝方法。首先,采用DepGraph构建依赖关系图,在此基础上评估各通道的全局重要性。其次,采用K-Medoids进行聚类,减少异常通道的影响。第三,将具有多个通道的集群的质心视为冗余通道并直接进行修剪,而具有单个通道的集群的质心由于其在下游任务中的独特作用而被保留。第四,根据剪枝比自动设置聚类个数,增强方法的灵活性和泛化性。在6个数据集上针对2个图像处理任务的9个模型上进行的大量实验结果表明,该方法优于目前最先进的修剪方法,并且每个关键模块都有助于提高性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Intra-group neighborhood relationship-aware channel pruning
The high computational and memory requirements of Convolutional Neural Networks (CNNs) limit the deployment of CNN-based image processing models on edge computing devices. To this end, the clustering-based structural pruning methods have been studied to prune the redundant channels. However, the conventional clustering-based pruning methods may not achieve satisfactory performances for the following reasons. First, the clustering is performed only based on the feature of the current layer, which is not enough to identify the importance of each channel precisely. Second, the K-Means or K-Means++ clustering-based pruning methods may be affected by abnormal channels easily. Third, the strategy of pruning the channels around centroids may prune important channels. Fourth, the number of clusters needs to be set manually, which may affect the flexibility and generalization. To solve these issues, an intro-group neighborhood relationship-aware (IGNRA) channel pruning method is proposed. First, DepGraph is adopted to construct the dependency graph, based on which the global-level importance of each channel is assessed. Second, K-Medoids is adopted to perform clustering to reduce the influence of abnormal channels. Third, the centroids of clusters with multiple channels are viewed as redundant channels and pruned directly, while the centroids of those with a single channel are retained due to their unique roles in the downstream tasks. Fourth, the number of the clusters is set according to the pruning ratio automatically to enhance the method’s flexibility and generalization. Extensive experimental results on 9 models for two image processing tasks on 6 datasets demonstrate that the proposed method outperforms the state-of-the-art pruning methods, and each key module contributes to the performance enhancement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Digital Signal Processing
Digital Signal Processing 工程技术-工程:电子与电气
CiteScore
5.30
自引率
17.20%
发文量
435
审稿时长
66 days
期刊介绍: Digital Signal Processing: A Review Journal is one of the oldest and most established journals in the field of signal processing yet it aims to be the most innovative. The Journal invites top quality research articles at the frontiers of research in all aspects of signal processing. Our objective is to provide a platform for the publication of ground-breaking research in signal processing with both academic and industrial appeal. The journal has a special emphasis on statistical signal processing methodology such as Bayesian signal processing, and encourages articles on emerging applications of signal processing such as: • big data• machine learning• internet of things• information security• systems biology and computational biology,• financial time series analysis,• autonomous vehicles,• quantum computing,• neuromorphic engineering,• human-computer interaction and intelligent user interfaces,• environmental signal processing,• geophysical signal processing including seismic signal processing,• chemioinformatics and bioinformatics,• audio, visual and performance arts,• disaster management and prevention,• renewable energy,
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信