COCM: Co-Occurrence-Based Consistency Matching in Domain-Adaptive Segmentation

Siyu Zhu, Yingjie Tian (), Fenfen Zhou, Kunlong Bai and Xiaoyu Song
Additional contact information
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
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

Mathematics, 2022, vol. 10, issue 23, 1-15

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.

Keywords: computer vision; semantic segmentation; domain adaptation; image matching (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/23/4468/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/23/4468/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:23:p:4468-:d:984992

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().