Mining Implicit Relations Among Image Channels for Few-Shot Semantic Segmentation

Xu Yuan, Ying Yang, Huafei Huang, Shuo Yu, Lili Cong
{"title":"Mining Implicit Relations Among Image Channels for Few-Shot Semantic Segmentation","authors":"Xu Yuan, Ying Yang, Huafei Huang, Shuo Yu, Lili Cong","doi":"10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00062","DOIUrl":null,"url":null,"abstract":"The goal of few-shot semantic segmentation (FSS) is to segment the foreground image of an unseen class in the query image by using a few labeled support images. Existing two-branch models mine support and query image information to improve segmentation results by employing support prototypes, calculating the similarity between support and query images, or fusing multi-scale features. Such methods only focus on the spatial information of the query image in the initial feature extraction and subsequent processes. Meanwhile, limited by the sample size, their ability to extract channel information is insufficient, thus leading to the information loss of the query image. To solve the issues, we propose an implicit channel relation based few-shot semantic segmentation method entitled MANGO. The implicit relation mining process is implemented after the initial feature extraction and before the two branches interact to fully mine the query image information. Specifically, the query channel features are taken as nodes to construct the graph structure to establish the relationship between nodes. The network motif is used to quantity the attribute features and structural features of nodes to enhance the relationship between channels. Finally, we aggregate the two features and mine the implicit relationship of nodes through graph representation learning. Experiments on PASCAL-5i and FSS-1000 datasets demonstrate that our proposed method outperforms the state-of-the-art methods.","PeriodicalId":43791,"journal":{"name":"Scalable Computing-Practice and Experience","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Computing-Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

The goal of few-shot semantic segmentation (FSS) is to segment the foreground image of an unseen class in the query image by using a few labeled support images. Existing two-branch models mine support and query image information to improve segmentation results by employing support prototypes, calculating the similarity between support and query images, or fusing multi-scale features. Such methods only focus on the spatial information of the query image in the initial feature extraction and subsequent processes. Meanwhile, limited by the sample size, their ability to extract channel information is insufficient, thus leading to the information loss of the query image. To solve the issues, we propose an implicit channel relation based few-shot semantic segmentation method entitled MANGO. The implicit relation mining process is implemented after the initial feature extraction and before the two branches interact to fully mine the query image information. Specifically, the query channel features are taken as nodes to construct the graph structure to establish the relationship between nodes. The network motif is used to quantity the attribute features and structural features of nodes to enhance the relationship between channels. Finally, we aggregate the two features and mine the implicit relationship of nodes through graph representation learning. Experiments on PASCAL-5i and FSS-1000 datasets demonstrate that our proposed method outperforms the state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于少镜头语义分割的图像通道隐式关系挖掘
少镜头语义分割(FSS)的目标是使用少量标记的支持图像来分割查询图像中未见类的前景图像。现有的双分支模型通过挖掘支持和查询图像信息,利用支持原型、计算支持和查询图像之间的相似度或融合多尺度特征来改善分割结果。这些方法在初始特征提取和后续处理中只关注查询图像的空间信息。同时,受样本量的限制,它们提取通道信息的能力不足,从而导致查询图像的信息丢失。为了解决这一问题,我们提出了一种基于隐式通道关系的少镜头语义分割方法MANGO。隐式关系挖掘过程在初始特征提取之后,在两个分支交互之前实现,充分挖掘查询图像信息。具体而言,将查询通道特征作为节点来构造图结构,建立节点之间的关系。利用网络基序对节点的属性特征和结构特征进行量化,增强通道之间的关系。最后,我们将两个特征聚合,并通过图表示学习挖掘节点之间的隐式关系。在PASCAL-5i和FSS-1000数据集上的实验表明,我们提出的方法优于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Scalable Computing-Practice and Experience
Scalable Computing-Practice and Experience COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
2.00
自引率
0.00%
发文量
10
期刊介绍: The area of scalable computing has matured and reached a point where new issues and trends require a professional forum. SCPE will provide this avenue by publishing original refereed papers that address the present as well as the future of parallel and distributed computing. The journal will focus on algorithm development, implementation and execution on real-world parallel architectures, and application of parallel and distributed computing to the solution of real-life problems.
期刊最新文献
Accident Attention System for Somnambulism Patients Application of Association Rule Mining Algorithm based on 5G Technology in Information Management System A Bone Fracture Detection using AI-Based Techniques Computer Hardware and Network Data Transmission based on Internet of Things Communication Technology Information Monitoring of Transmission Lines Based on Internet of Things Technology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1