arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.00574cs.CV

PVG:用于视觉识别的渐进式视觉图

PVG: Progressive Vision Graph for Vision Recognition

Zhongshan PoolNet Technology Ltd(中山博冠科技有限公司);Zhejiang University(浙江大学);Tencent Youtu Lab(腾讯优图实验室)

Jiafu Wu, Jian Li, Jiangning Zhang, Boshen Zhang, Mingmin Chi, Yabiao Wang, Chengjie Wang

AI总结:

针对 ViG 邻居选择不准、聚合开销大及深层过度平滑问题,提出 PVG 架构,通过 PSGC、MaxE 和 GraphLU 提升视觉识别性能,并在 ImageNet-1K 与 COCO 上验证优势。

摘要:

基于卷积和基于 Transformer 的视觉骨干网络分别将图像处理为网格结构或序列结构,在捕捉不规则物体方面不够灵活。尽管 Vision GNN(ViG)针对复杂图像采用图级特征,但它仍存在一些问题,例如邻居节点选择不准确、节点信息聚合计算代价高昂,以及深层中的过度平滑。为解决上述问题,我们提出了一种用于视觉识别任务的渐进式视觉图(Progressive Vision Graph,PVG)架构。与以往工作相比,PVG 包含三个主要组件:1)渐进分离图构建(Progressively Separated Graph Construction,PSGC),通过随着层加深逐渐增加全局图分支的通道并减少局部分支的通道来引入二阶相似性;2)利用最大池化和数学期望(Max pooling and mathematical Expectation,MaxE)聚合丰富邻居信息的邻居节点信息聚合与更新模块;3)图误差线性单元(Graph error Linear Unit,GraphLU),以一种松弛形式增强低值信息,从而减少对图像细节信息的压缩,以缓解过度平滑。在主流基准上的大量实验证明了 PVG 相对于最先进方法的优越性,例如,我们的 PVG-S 在 ImageNet-1K 上获得 83.0% 的 Top-1 准确率,比基于 GNN 的 ViG-S 高出 0.9,同时参数量减少 18.5%,而最大的 PVG-B 获得 84.2%,较 ViG-B 提升 0.5。此外,在 COCO 数据集上,我们的 PVG-S 相比 ViG-S 获得 1.3 box AP 和 0.4 mask AP 的增益。

英文摘要:

Convolution-based and Transformer-based vision backbone networks process images into the grid or sequence structures, respectively, which are inflexible for capturing irregular objects. Though Vision GNN (ViG) adopts graph-level features for complex images, it has some issues, such as inaccurate neighbor node selection, expensive node information aggregation calculation, and over-smoothing in the deep layers. To address the above problems, we propose a Progressive Vision Graph (PVG) architecture for vision recognition task. Compared with previous works, PVG contains three main components: 1) Progressively Separated Graph Construction (PSGC) to introduce second-order similarity by gradually increasing the channel of the global graph branch and decreasing the channel of local branch as the layer deepens; 2) Neighbor nodes information aggregation and update module by using Max pooling and mathematical Expectation (MaxE) to aggregate rich neighbor information; 3) Graph error Linear Unit (GraphLU) to enhance low-value information in a relaxed form to reduce the compression of image detail information for alleviating the over-smoothing. Extensive experiments on mainstream benchmarks demonstrate the superiority of PVG over state-of-the-art methods, e.g., our PVG-S obtains 83.0% Top-1 accuracy on ImageNet-1K that surpasses GNN-based ViG-S by +0.9 with the parameters reduced by 18.5%, while the largest PVG-B obtains 84.2% that has +0.5 improvement than ViG-B. Furthermore, our PVG-S obtains +1.3 box AP and +0.4 mask AP gains than ViG-S on COCO dataset.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑