{"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.
期刊介绍:
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.