Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Runmin Wu

dblp:250/4461 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Segmentation and scene understanding · 70% 3D vision · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding › instance segmentation
instance co-segmentation
0.712023
MISC210K: A Large-Scale Dataset for Multi-Instance Semantic Correspondence · CVPR 2023
Computer vision › 3D vision › correspondence estimation
semantic correspondence
0.712023
MISC210K: A Large-Scale Dataset for Multi-Instance Semantic Correspondence · CVPR 2023
Computer vision › Segmentation and scene understanding
edge detection
0.412019
A Mutual Learning Method for Salient Object Detection With Intertwined Multi-Supervision · CVPR 2019
Computer vision › Segmentation and scene understanding › saliency detection
salient object detection
0.412019
A Mutual Learning Method for Salient Object Detection With Intertwined Multi-Supervision · CVPR 2019

Methods — techniques the papers use, named apart from their topics

dual-path collaborative learning · 0.7mutual learning · 0.4multi-supervision · 0.4
YearPublicationVenuePosition
2024 Class-conditional domain adaptation for semantic segmentation
abstract
Semantic segmentation is an important sub-task for many applications. However, pixel-level ground-truth labeling is costly, and there is a tendency to overfit to training data, thereby limiting the generalization ability. Unsupervised domain adaptation can potentially address these problems by allowing systems trained on labelled datasets from the source domain (including less expensive synthetic domain) to be adapted to a novel target domain. The conventional approach involves automatic extraction and alignment of the representations of source and target domains globally. One limitation of this approach is that it tends to neglect the differences between classes: representations of certain classes can be more easily extracted and aligned between the source and target domains than others, limiting the adaptation over all classes. Here, we address this problem by introducing a Class-Conditional Domain Adaptation (CCDA) method. This incorporates a class-conditional multi-scale discriminator and class-conditional losses for both segmentation and adaptation. Together, they measure the segmentation, shift the domain in a class-conditional manner, and equalize the loss over classes. Experimental results demonstrate that the performance of our CCDA method matches, and in some cases, surpasses that of state-of-the-art methods.
Yue Wang 0038, James H. Elder, Runmin Wu, Huchuan Lu
Comput. Vis. Media4
2023 MISC210K: A Large-Scale Dataset for Multi-Instance Semantic Correspondence
abstract
Semantic correspondence have built up a new way for object recognition. However current single-object matching schema can be hard for discovering commonalities for a category and far from the real-world recognition tasks. To fill this gap, we design the multi-instance semantic correspondence task which aims at constructing the correspondence between multiple objects in an image pair. To support this task, we build a multi-instance semantic correspondence (MISC) dataset from COCO Detection 2017 task called MISC210K. We construct our dataset as three steps: (1) category selection and data cleaning; (2) keypoint design based on 3D models and object description rules; (3) human-machine collaborative annotation. Following these steps, we select 34 classes of objects with 4,812 challenging images annotated via a well designed semi-automatic workflow, and finally acquire 218,179 image pairs with instance masks and instance-level keypoint pairs annotated. We design a dual-path collaborative learning pipeline to train instance-level co-segmentation task and fine-grained level correspondence task together. Benchmark evaluation and further ablation results with detailed analysis are provided with three future directions proposed. Our project is available on https://github.com/YXSUNMADMAX/MISC210K.
Yixuan Sun, Haijing Guo, Yuzhou Zhao, Runmin Wu, Yizhou Yu, Weifeng Ge
CVPR5
2020 Synergistic Saliency and Depth Prediction for RGB-D Saliency Detection
Yue Wang 0038, James H. Elder, Runmin Wu, Huchuan Lu, Lu Zhang 0053
ACCV (2)4
2019 A Mutual Learning Method for Salient Object Detection With Intertwined Multi-Supervision
abstract
Though deep learning techniques have made great progress in salient object detection recently, the predicted saliency maps still suffer from incomplete predictions due to the internal complexity of objects and inaccurate boundaries caused by strides in convolution and pooling operations. To alleviate these issues, we propose to train saliency detection networks by exploiting the supervision from not only salient object detection, but also foreground contour detection and edge detection. First, we leverage salient object detection and foreground contour detection tasks in an intertwined manner to generate saliency maps with uniform highlight. Second, the foreground contour and edge detection tasks guide each other simultaneously, thereby leading to preciser foreground contour prediction and reducing the local noises for edge prediction. In addition, we develop a novel mutual learning module (MLM) which serves as the building block of our method. Each MLM consists of multiple network branches trained in a mutual learning manner, which improves the performance by a large margin. Extensive experiments on seven challenging datasets demonstrate that the proposed method has delivered state-of-the-art results in both salient object detection and edge detection.
Runmin Wu, Mengyang Feng, Wenlong Guan, Dong Wang 0004, Huchuan Lu, Errui Ding
CVPR1