Demo Data from EDBT 2026 / reviewers in the wild / expert
Haocheng Shen
dblp:160/3613
· DBLP profile ↗
11ranked-venue papers
4as first author
6since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 8 · 4 first-author · 3 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 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
3 papers |
Vision and language · 36% Generative modeling · 32% Transfer learning and domain adaptation · 14% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › visual grounding › language-guided segmentation
reasoning segmentation |
1.0 | 1 | 2026 | LENS: Learning to Segment Anything with Unified Reinforced Reasoning · AAAI 2026 |
Computer vision › Vision and language › visual grounding
text-guided segmentation |
1.0 | 1 | 2026 | LENS: Learning to Segment Anything with Unified Reinforced Reasoning · AAAI 2026 |
Machine learning › Generative modeling
autoregressive model |
0.9 | 1 | 2025 | ControlAR: Controllable Image Generation with Autoregressive Models · ICLR 2025 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.9 | 1 | 2025 | Progressive Visual Prompt Learning with Contrastive Feature Re-formation · Int. J. Comput. Vis. 2025 |
Machine learning › Generative modeling › diffusion model › controllable generation
controllable image generation |
0.9 | 1 | 2025 | ControlAR: Controllable Image Generation with Autoregressive Models · ICLR 2025 |
Machine learning › Transfer learning and domain adaptation › parameter-efficient transfer learning
visual prompt tuning |
0.9 | 1 | 2025 | Progressive Visual Prompt Learning with Contrastive Feature Re-formation · Int. J. Comput. Vis. 2025 |
Natural language and speech › Language models and text generation
chain-of-thought reasoning |
0.3 | 1 | 2026 | LENS: Learning to Segment Anything with Unified Reinforced Reasoning · AAAI 2026 |
Computer vision › Vision and language
vision-language model |
0.3 | 1 | 2026 | LENS: Learning to Segment Anything with Unified Reinforced Reasoning · AAAI 2026 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | ControlAR: Controllable Image Generation with Autoregressive Models · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
unified reward design · 1.0reinforcement learning · 1.0tokenization · 0.9prompt learning · 0.9control encoder · 0.9contrastive learning · 0.9conditional decoding · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LENS: Learning to Segment Anything with Unified Reinforced ReasoningabstractText-prompted image segmentation enables fine-grained visual understanding and is critical for applications such as human-computer interaction and robotics. However, existing supervised fine-tuning methods typically ignore explicit chain-of-thought (CoT) reasoning at test time, which limits their ability to generalize to unseen prompts and domains. To address this issue, we introduce LENS, a scalable reinforcement-learning framework that jointly optimizes the reasoning process and segmentation in an end-to-end manner. We propose unified reinforcement-learning rewards that span sentence-, box-, and segment-level cues, encouraging the model to generate informative CoT rationales while refining mask quality. Using a publicly available 3-billion-parameter vision–language model, i.e., Qwen2.5-VL-3B-Instruct, LENS achieves an average cIoU of 81.2% on the RefCOCO, RefCOCO+, and RefCOCOg benchmarks, outperforming the strong fine-tuned method, i.e., GLaMM, by up to 5.6%. These results demonstrate that RL-driven CoT reasoning significantly enhances text-prompted segmentation and offers a practical path toward more generalizable Segment Anything models (SAM). Lianghui Zhu, Bin Ouyang, Tianheng Cheng, Haocheng Shen, Longjin Ran, Xiaoxin Chen 0001, Li Yu 0003, Wenyu Liu 0001, Xinggang Wang |
AAAI | 6 |
| 2025 | ControlAR: Controllable Image Generation with Autoregressive ModelsabstractAutoregressive (AR) models have reformulated image generation as next-token prediction, demonstrating remarkable potential and emerging as strong competitors to diffusion models. However, control-to-image generation, akin to ControlNet, remains largely unexplored within AR models. Although a natural approach, inspired by advancements in Large Language Models, is to tokenize control images into tokens and prefill them into the autoregressive model before decoding image tokens, it still falls short in generation quality compared to ControlNet and suffers from inefficiency. To this end, we introduce ControlAR, an efficient and effective framework for integrating spatial controls into autoregressive image generation models. Firstly, we explore control encoding for AR models and propose a lightweight control encoder to transform spatial inputs (e.g., canny edges or depth maps) into control tokens. Then ControlAR exploits the conditional decoding method to generate the next image token conditioned on the per-token fusion between control and image tokens, similar to positional encodings. Compared to prefilling tokens, using conditional decoding significantly strengthens the control capability of AR models but also maintains the model efficiency. Furthermore, the proposed ControlAR surprisingly empowers AR models with arbitrary-resolution image generation via conditional decoding and specific controls. Extensive experiments can demonstrate the controllability of the proposed ControlAR for the autoregressive control-to-image generation across diverse inputs, including edges, depths, and segmentation masks. Furthermore, both quantitative and qualitative results indicate that ControlAR surpasses previous state-of-the-art
controllable diffusion models, e.g., ControlNet++. Zongming Li, Tianheng Cheng, Shoufa Chen, Peize Sun, Haocheng Shen, Longjin Ran, Xiaoxin Chen 0001, Wenyu Liu 0001, Xinggang Wang |
ICLR | 5 |
| 2025 | Progressive Visual Prompt Learning with Contrastive Feature Re-formation
Haocheng Shen, Boheng Chen, Yixuan Liao, Xiaoxin Chen 0001, Limin Wang 0002 |
Int. J. Comput. Vis. | 3 |
| 2023 | PiercingEye: Identifying Both Faint and Distinct Clues for Explainable Fake News Detection with Progressive Dynamic Graph MiningabstractExplainability is crucial for the successful use of AI for fake news detection (FND). Researchers aim to improve the explainability of FND by highlighting important descriptions in crowd-contributed comments as clues. From the perspective of law and sociology, there are distinct clues that are easy to discover and understand, and faint clues that require careful observation and analysis. For example, in fake news related to COVID-Omicron showing increased pathogenicity and transmissibility, distinct clues might involve virologists’ opinions regarding the inverse correlation between pathogenicity and transmissibility. Meanwhile, faint clues might be reflected in an infected person’s claim that the symptoms are milder than a cold (indirectly indicating reduced pathogenicity). Occasionally, the statements of some ordinary eyewitnesses can decisively reveal the truth of the news, leading to the judgment of fake news. Existing methods generally use static networks to model the entire news life-cycle, which makes it fail to capture the subtle dynamic interactions between individual clues and news. Thereby faint clues, whose relations to the truth of news are challenging to be characterized and extracted directly, are more likely to be overshadowed by distinct clues. To address this issue, we propose an explainable FND method, dubbed as PiercingEye, which leverages dynamic interaction information to progressively mine valuable clues. PiercingEye models the news propagation topology as a dynamic graph, with interactive comments serving as nodes, and employs the time-semantic encoding mechanism to refine the modeling of temporal interaction information between comments and news to preserve faint clues. Subsequently, it utilizes the self-attention mechanism to aggregate distinct and faint clues for FND. Experimental results demonstrate that PiercingEye outperforms state-of-the-art methods and is capable of identifying both faint and distinct clues for humans to debunk fake news. Yasan Ding, Bin Guo 0001, Yan Liu 0045, Hao Wang 0182, Haocheng Shen, Zhiwen Yu 0001 |
ECAI | 5 |
| 2022 | Adversarial learning with data selection for cross-domain histopathological breast Cancer segmentation
Zhenrong Lin, Jidong Li, Qipeng Yao, Haocheng Shen, Lihang Wan |
Multim. Tools Appl. | 4 |
| 2022 | MetaDetector: Meta Event Knowledge Transfer for Fake News DetectionabstractThe blooming of fake news on social networks has devastating impacts on society, the economy, and public security. Although numerous studies are conducted for the automatic detection of fake news, the majority tend to utilize deep neural networks to learn event-specific features for superior detection performance on specific datasets. However, the trained models heavily rely on the training datasets and are infeasible to apply to upcoming events due to the discrepancy between event distributions. Inspired by domain adaptation theories, we propose an end-to-end adversarial adaptation network, dubbed as MetaDetector , to transfer meta knowledge (event-shared features) between different events. Specifically, MetaDetector pushes the feature extractor and event discriminator to eliminate event-specific features and preserve required meta knowledge by adversarial training. Furthermore, the pseudo-event discriminator is utilized to evaluate the importance of news records in historical events to obtain partial knowledge that are discriminative for detecting fake news. Under the coordinated optimization among all the submodules, MetaDetector accurately transfers the meta knowledge of historical events to the upcoming event for fact checking. We conduct extensive experiments on two real-world datasets collected from Sina Weibo and Twitter. The experimental results demonstrate that MetaDetector outperforms the state-of-the-art methods, especially when the distribution discrepancy between events is significant. Yasan Ding, Bin Guo 0001, Yan Liu 0045, Yunji Liang, Haocheng Shen, Zhiwen Yu 0001 |
ACM Trans. Intell. Syst. Technol. | 5 |
| 2020 | Deep Active Learning for Breast Cancer Segmentation on Immunohistochemistry Images
Haocheng Shen, Kuan Tian, Pei Dong, Jun Zhang 0018, Kezhou Yan, Shannon Che, Jianhua Yao 0001, Pifu Luo, Xiao Han 0011 |
MICCAI (5) | 1 |
| 2020 | Weakly-Supervised Nucleus Segmentation Based on Point Annotations: A Coarse-to-Fine Self-Stimulated Learning Strategy
Kuan Tian, Jun Zhang 0018, Haocheng Shen, Kezhou Yan, Pei Dong, Jianhua Yao 0001, Shannon Che, Pifu Luo, Xiao Han 0011 |
MICCAI (5) | 3 |
| 2017 | Fully connected CRF with data-driven prior for multi-class brain tumor segmentationabstractGrid conditional random fields (CRFs) are widely applied in both natural and medical image segmentation tasks. However, they only consider the label coherence in neighborhood pixels or regions, which limits their ability to model long-range connections within the image and generally results in excessive smoothing of tumor boundaries. In this paper, we present a novel method for brain tumor segmentation in MR images based on fully-connected CRF (FC-CRF) model that establishes pairwise potentials on all pairs of pixels in the images. We employ a hierarchical approach to differentiate different structures of tumor and further formulate a FC-CRF model with learned data-driven prior knowledge of tumor core. The methods were evaluated on the testing and leaderboard set of Brain Tumor Image Segmentation Benchmark (BRATS) 2013 challenge. The precision of segmented tumor boundaries is improved significantly and the results are competitive compared to the start-of-the-arts. Haocheng Shen, Jianguo Zhang 0001 |
ICIP | 1 |
| 2017 | Efficient symmetry-driven fully convolutional network for multimodal brain tumor segmentationabstractIn this paper, we present a novel and efficient method for brain tumor (and sub regions) segmentation in multimodal MR images based on a fully convolutional network (FCN) that enables end-to-end training and fast inference. Our structure consists of a downsampling path and three upsampling paths, which extract multi-level contextual information by concatenating hierarchical feature representation from each upsam-pling path. Meanwhile, we introduce a symmetry-driven FCN by the proposal of using symmetry difference images. The model was evaluated on Brain Tumor Image Segmentation Benchmark (BRATS) 2013 challenge dataset and achieved the state-of-the-art results while the computational cost is less than competitors. Haocheng Shen, Jianguo Zhang 0001, Wei-Shi Zheng 0001 |
ICIP | 1 |
| 2017 | Boundary-Aware Fully Convolutional Network for Brain Tumor Segmentation
Haocheng Shen, Jianguo Zhang 0001, Stephen J. McKenna |
MICCAI (2) | 1 |