Author
Listed:
- Siyu Zhu
(School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, China)
- Yingjie Tian
(School of Economics and Management, University of Chinese Academy of Sciences, Beijing 100190, China
The Research Center on Fictitious Economy and Data Science, Chinese Academy of Sciences, Beijing 100190, China
The Key Laboratory of Big Data Mining and Knowledge Management, Chinese Academy of Sciences, Beijing 100190, China
The MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation, University of Chinese Academy of Sciences, Beijing 100190, China)
- Fenfen Zhou
(School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, China)
- Kunlong Bai
(School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, China)
- Xiaoyu Song
(Department of Electrical and Computer Engineering, Portland State University, Portland, OR 97203, USA)
Abstract
This paper focuses on domain adaptation in a semantic segmentation task. Traditional methods regard the source domain and the target domain as a whole, and the image matching is determined by random seeds, leading to a low degree of consistency matching between domains and interfering with the reduction in the domain gap. Therefore, we designed a two-step, three-level cascaded domain consistency matching strategy—co-occurrence-based consistency matching (COCM)—in which the two steps are: Step 1, in which we design a matching strategy from the perspective of category existence and filter the sub-image set with the highest degree of matching from the image of the whole source domain, and Step 2, in which, from the perspective of spatial existence, we propose a method of measuring the PIOU score to quantitatively evaluate the spatial matching of co-occurring categories in the sub-image set and select the best-matching source image. The three levels mean that in order to improve the importance of low-frequency categories in the matching process, we divide the categories into three levels according to the frequency of co-occurrences between domains; these three levels are the head, middle, and tail levels, and priority is given to matching tail categories. The proposed COCM maximizes the category-level consistency between the domains and has been proven to be effective in reducing the domain gap while being lightweight. The experimental results on general datasets can be compared with those of state-of-the-art (SOTA) methods.
Suggested Citation
Siyu Zhu & Yingjie Tian & Fenfen Zhou & Kunlong Bai & Xiaoyu Song, 2022.
"COCM: Co-Occurrence-Based Consistency Matching in Domain-Adaptive Segmentation,"
Mathematics, MDPI, vol. 10(23), pages 1-15, November.
Handle:
RePEc:gam:jmathe:v:10:y:2022:i:23:p:4468-:d:984992
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4468-:d:984992. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.