Demo Data from SIGIR 2026 / reviewers in the wild / expert
Duojun Huang
dblp:352/5155
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 3 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
3 papers |
Transfer learning and domain adaptation · 32% Vision and language · 24% Segmentation and scene understanding · 18% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › multimodal evaluation
video caption evaluation |
1.0 | 1 | 2026 | VCapsBench: A Large-scale Fine-grained Benchmark for Video Caption Quality Evaluation · AAAI 2026 |
Natural language and speech › Language models and text generation › prompting
automatic prompt generation |
0.8 | 1 | 2024 | AlignSAM: Aligning Segment Anything Model to Open Context via Reinforcement Learning · CVPR 2024 |
Computer vision › Segmentation and scene understanding
prompt-based segmentation |
0.8 | 1 | 2024 | AlignSAM: Aligning Segment Anything Model to Open Context via Reinforcement Learning · CVPR 2024 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
active domain adaptation |
0.7 | 1 | 2023 | Divide and Adapt: Active Domain Adaptation via Customized Learning · CVPR 2023 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.7 | 1 | 2023 | Divide and Adapt: Active Domain Adaptation via Customized Learning · CVPR 2023 |
Machine learning › Generative modeling › video generation
text-to-video generation |
0.3 | 1 | 2026 | VCapsBench: A Large-scale Fine-grained Benchmark for Video Caption Quality Evaluation · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
large vision-language model · 1.0contrastive question answering · 1.0semantic recalibration · 0.8reinforcement learning · 0.8policy network · 0.8uncertainty sampling · 0.7gaussian mixture model · 0.7active learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | VCapsBench: A Large-scale Fine-grained Benchmark for Video Caption Quality EvaluationabstractVideo captions play a crucial role in text-to-video generation tasks, as their quality directly influences the semantic coherence and visual fidelity of the generated videos. Although large vision-language models (VLMs) have demonstrated significant potential in caption generation, existing benchmarks inadequately address fine-grained evaluation, particularly in capturing spatial-temporal details critical for video generation. To address this gap, we introduce the Fine-grained Video Caption Evaluation Benchmark (VCapsBench), the first large-scale fine-grained benchmark comprising 5,677 (5K+) videos and 109,796 (100K+) question-answer pairs. These QA-pairs are systematically annotated across 21 fine-grained dimensions (e.g., camera movement, and shot type) that are empirically proven critical for text-to-video generation. We further introduce three metrics (Accuracy (AR), Inconsistency Rate (IR), Coverage Rate (CR)), and an automated evaluation pipeline leveraging a large language model (LLM) to verify caption quality via contrastive QA-pairs analysis. Our benchmark can advance the development of robust text-to-video models by providing actionable insights for caption optimization. Shi-Xue Zhang, Hongfa Wang, Duojun Huang, Xiaobin Zhu 0001, Xu-Cheng Yin |
AAAI | 3 |
| 2025 | Free Meal: Boosting Semi-Supervised Polyp Segmentation by Harvesting Negative SamplesabstractExisting semi-supervised polyp segmentation methods assume that unlabeled images are positive, containing lesions to be annotated, while neglecting negative samples that are widely available in practice. This letter reveals that harvesting lesion-free negative samples can effectively boost polyp segmentation performance. Directly extending the labeled set with negative samples is sub-optimal since it introduces potential class imbalance. To overcome this challenge, we first introduce a data augmentation strategy named TypeMix. By fusing unlabeled samples with negative samples, the network can better benefit from diverse features provided by negatives while alleviating the potential side effects. Furthermore, it is observed that the number of negative samples significantly exceeds that of lesion samples. To reduce redundancy and improve training efficiency, we propose a dynamic informativeness-aware sampling strategy, prioritizing the active selection of high-valuable negative samples. Extensive experiments on public datasets demonstrate that our simple but effective strategies are enough to consistently outperform other state-of-the-art methods, offering new possibilities for future work from a data collection perspective. Xinyu Xiong, Wenxue Li 0003, Duojun Huang |
IEEE Signal Process. Lett. | 4 |
| 2024 | AlignSAM: Aligning Segment Anything Model to Open Context via Reinforcement LearningabstractPowered by massive curated training data, Segment Any-thing Model (SAM) has demonstrated its impressive generalization capabilities in open-world scenarios with the guidance of prompts. However, the vanilla SAM is class-agnostic and heavily relies on user-provided prompts to segment objects of interest. Adapting this method to diverse tasks is crucial for accurate target identification and to avoid suboptimal segmentation results. In this paper, we propose a novel framework, termed AlignSAM, designed for automatic prompting for aligning SAM to an open context through reinforcement learning. Anchored by an agent, AlignSAM enables the generality of the SAM model across diverse downstream tasks while keeping its parameters frozen. Specifically, AlignSAM initiates a prompting agent to iteratively refine segmentation predictions by interacting with the foundational model. It integrates a reinforcement learning policy network to provide informative prompts to the foundational models. Additionally, a semantic recal-ibration module is introduced to provide fine-grained labels of prompts, enhancing the model's proficiency in handling tasks encompassing explicit and implicit semantics. Experiments conducted on various challenging segmentation tasks among existing foundation models demonstrate the superiority of the proposed AlignSAM over state-of-the-art approaches. Project page: https://github.com/Duojun-Huang/AIignSAM-CVPR2024. Duojun Huang, Xinyu Xiong, Jichang Li, Zequn Jie, Lin Ma 0002, Guanbin Li |
CVPR | 1 |
| 2023 | Divide and Adapt: Active Domain Adaptation via Customized LearningabstractActive domain adaptation (ADA) aims to improve the model adaptation performance by incorporating active learning (AL) techniques to label a maximally-informative subset of target samples. Conventional AL methods do not consider the existence of domain shift, and hence, fail to identify the truly valuable samples in the context of domain adaptation. To accommodate active learning and domain adaption, the two naturally different tasks, in a collaborative framework, we advocate that a customized learning strategy for the target data is the key to the success of ADA solutions. We present Divide-and-Adapt (DiaNA), a new ADA framework that partitions the target instances into four categories with stratified transferable properties. With a novel data subdivision protocol based on uncertainty and domainness, DiaNA can accurately recognize the most gainful samples. While sending the informative instances for annotation, DiaNA employs tailored learning strategies for the remaining categories. Furthermore, we propose an informativeness score that unifies the data partitioning criteria. This enables the use of a Gaussian mixture model (GMM) to automatically sample unlabeled data into the proposed four categories. Thanks to the “divide-and-adapt” spirit, DiaNA can handle data with large variations of domain gap. In addition, we show that DiaNA can generalize to different domain adaptation settings, such as unsupervised domain adaptation (UDA), semi-supervised domain adaptation (SSDA), source-free domain adaptation (SFDA), etc. Duojun Huang, Jichang Li, Weikai Chen 0001, Junshi Huang, Zhenhua Chai, Guanbin Li |
CVPR | 1 |