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

Wenjun Hui

dblp:310/5027 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 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
3 papers
Segmentation and scene understanding · 56% Graph learning · 28% Reinforcement learning · 12%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
camouflaged object detection
1.522024
Implicit-Explicit Motion Learning for Video Camouflaged Object Detection · IEEE Trans. Multim. 2024
Endow SAM with Keen Eyes: Temporal-Spatial Prompt Learning for Video Camouflaged Object Detection · CVPR 2024
Computer vision › Segmentation and scene understanding › camouflaged object detection
video camouflaged object detection
1.522024
Implicit-Explicit Motion Learning for Video Camouflaged Object Detection · IEEE Trans. Multim. 2024
Endow SAM with Keen Eyes: Temporal-Spatial Prompt Learning for Video Camouflaged Object Detection · CVPR 2024
Machine learning › Graph learning › graph neural network › efficient graph neural network
graph condensation
0.912025
Towards Pre-trained Graph Condensation via Optimal Transport · NeurIPS 2025
Machine learning › Graph learning
graph neural network
0.912025
Towards Pre-trained Graph Condensation via Optimal Transport · NeurIPS 2025
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
motion learning
0.812024
Implicit-Explicit Motion Learning for Video Camouflaged Object Detection · IEEE Trans. Multim. 2024
Machine learning › Efficient and distributed learning
dataset distillation
0.312025
Towards Pre-trained Graph Condensation via Optimal Transport · NeurIPS 2025
Computer vision › Segmentation and scene understanding
prompt-based segmentation
0.212024
Endow SAM with Keen Eyes: Temporal-Spatial Prompt Learning for Video Camouflaged Object Detection · CVPR 2024
Computer vision › Segmentation and scene understanding › prompt-based segmentation
segment anything model
0.212024
Endow SAM with Keen Eyes: Temporal-Spatial Prompt Learning for Video Camouflaged Object Detection · CVPR 2024

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

semantic harmonizer · 0.9optimal transport · 0.9graph diffusion augmentation · 0.9temporal-spatial prompt learning · 0.8motion-driven self-prompt learning · 0.8motion field estimation · 0.8long-range consistency · 0.8cross-scale fusion · 0.8
YearPublicationVenuePosition
2026 MRCNet: Motion Reasoning Chain for Cross Modal Video Camouflaged Object Detection
abstract
Video camouflaged object detection (VCOD) aims to identify objects that seamlessly blend into their surroundings in video sequences. Traditional methods merely rely on visual cues to capture inter-frame motion that reveals camouflaged objects. However, the high similarity between camouflaged objects and their environments often renders pure reliance on visual cues unreliable. Additionally, random motions including camera shaking and abrupt scene transitions also inevitably bring noise into the identification process. To overcome these challenges, we propose a Motion Reasoning Chain Network (MRCNet), a novel cross-modal VCOD framework that emulates the human thought process when observing camouflaged objects, i.e., motion reasoning. Specifically, we introduce a generative sampling strategy grounded in multimodal large language models (MLLMs) to bridge the implicit knowledge space of MLLMs and the explicit representation space regarding the attributes of camouflaged objects, thereby enabling the effective establishment of the motion reasoning chain tailored for VCOD. This process provides semantic guidance for visual comprehension of camouflaged objects through motion and concept attribute reasoning. To improve the identification capability of camouflaged objects, we develop motion representation learning driven by the motion reasoning chain. It introduces hierarchical de-biased motion prototype learning to mitigate hallucinations of MLLMs, boosting the motion perception. To learn precise prompts for the visual foundation model, cross-modal prompt learning further incorporates the de-biased concept prototype into visual representations to enhance the visual comprehension of camouflaged objects. Extensive experiments across three datasets demonstrate that MRCNet achieves state-of-the-art results on both general metrics and spatiotemporal consistency metrics.
Wenjun Hui, Zhenfeng Zhu, Shuai Zheng 0005, Ming-Ming Cheng, Huchuan Lu, Yao Zhao 0001
IEEE Trans. Pattern Anal. Mach. Intell.1
2025 Towards Pre-trained Graph Condensation via Optimal Transport
abstract
Graph condensation (GC) aims to distill the original graph into a small-scale graph, mitigating redundancy and accelerating GNN training. However, conventional GC approaches heavily rely on rigid GNNs and task-specific supervision. Such a dependency severely restricts their reusability and generalization across various tasks and architectures. In this work, we revisit the goal of ideal GC from the perspective of GNN optimization consistency, and then a generalized GC optimization objective is derived, by which those traditional GC methods can be viewed nicely as special cases of this optimization paradigm. Based on this, \textbf{Pre}-trained \textbf{G}raph \textbf{C}ondensation (\textbf{PreGC}) via optimal transport is proposed to transcend the limitations of task- and architecture-dependent GC methods. Specifically, a hybrid-interval graph diffusion augmentation is presented to suppress the weak generalization ability of the condensed graph on particular architectures by enhancing the uncertainty of node states. Meanwhile, the matching between optimal graph transport plan and representation transport plan is tactfully established to maintain semantic consistencies across source graph and condensed graph spaces, thereby freeing graph condensation from task dependencies. To further facilitate the adaptation of condensed graphs to various downstream tasks, a traceable semantic harmonizer from source nodes to condensed nodes is proposed to bridge semantic associations through the optimized representation transport plan in pre-training. Extensive experiments verify the superiority and versatility of PreGC, demonstrating its task-independent nature and seamless compatibility with arbitrary GNNs.
Yeyu Yan, Shuai Zheng 0005, Wenjun Hui, Xiangkai Zhu, Dong Chen 0043, Zhenfeng Zhu, Yao Zhao 0001, Kunlun He
NeurIPS3
2024 Endow SAM with Keen Eyes: Temporal-Spatial Prompt Learning for Video Camouflaged Object Detection
abstract
The Segment Anything Model (SAM), a prompt-driven foundational model, has demonstrated remarkable performance in natural image segmentation. However, its application in video camouflaged object detection (VCOD) en-counters challenges, chiefly stemming from the overlooked temporal-spatial associations and the unreliability of user-provided prompts for camouflaged objects that are difficult to discern with the naked eye. To tackle the above issues, we endow SAM with keen eyes and propose the Temporal-spatial Prompt SAM (TSP-SAM), a novel approach tailored for VCOD via an ingenious prompted learning scheme. Firstly, motion-driven self-prompt learning is employed to capture the camouflaged object, thereby bypassing the need for user-provided prompts. With the detected subtle motion cues across consecutive video frames, the overall movement of the camouflaged object is captured for more precise spa-tial localization. Subsequently, to eliminate the prompt bias resulting from inter-frame discontinuities, the long-range consistency within the video sequences is taken into account to promote the robustness of the self-prompts. It is also injected into the encoder of SAM to enhance the representational capabilities. Extensive experimental results on two benchmarks demonstrate that the proposed TSP-SAM achieves a significant improvement over the state-of-the-art methods. With the mIoU metric increasing by 7.8% and 9.6%, TSP-SAM emerges as a groundbreaking step forward in the field of VCOD.
Wenjun Hui, Zhenfeng Zhu, Shuai Zheng 0005, Yao Zhao 0001
CVPR1
2024 Implicit-Explicit Motion Learning for Video Camouflaged Object Detection
abstract
Video camouflaged object detection aims to identify objects that are visually concealed within the surroundings in a video. Most of the existing methods fall into analyzing the implicit inter-frame motion to capture the camouflaged object. However, due to a lack of exploring the prior explicit motion of the camouflaged object, these works generally encounter difficulty in capturing the complete camouflaged object. To address this issue, we propose to integrate implicit and explicit motion learning into a unified framework, namelyImplicit-Explicit Motion Learning network (IMEX), for video camouflaged object detection. Specifically, to promote the identifiability of the camouflaged object, a cross-scale representation fusion was proposed for global inter-frame alignment. By establishing cross-scale temporal-spatial association and aggregating the temporal-spatial attentive representations, it also achieves an elimination of the implicit motion of inter-frame to some extent. Moreover, to further improve the discriminability of boundary regions of the detected object, an explicit motion-induced consistency preserving of camouflaged objects is proposed, in which the prior boundary-aware explicit motion field is leveraged to supervise the consistency of camouflaged objects in consecutive frames. Extensive experiments show that our proposed IMEX achieves substantial performance improvements by a large margin.
Wenjun Hui, Zhenfeng Zhu, Guanghua Gu, Meiqin Liu 0002, Yao Zhao 0001
IEEE Trans. Multim.1
2022 Gradient-based refined class activation map for weakly supervised object localization
Wenjun Hui, Chuangchuang Tan, Guanghua Gu, Yao Zhao 0001
Pattern Recognit.1
2021 Attention-based Dual-Branches Localization Network for Weakly Supervised Object Localization
abstract
Weakly supervised object localization exploits the last convolutional feature maps of classification model and the weights of Fully-Connected (FC) layer to achieves localization. However, high-level feature maps for localization lack edge features. Additionally, the weights are specific to classification task, causing only discriminative regions to be discovered. In order to fuse edge features and adjust the attention distribution for feature map channels, we propose an efficient method called Attention-based Dual-Branches Localization (ADBL) Network, in which dual-branches structure and attention mechanism are adopted to mine edge features and non-discriminative features for locating more target areas. Specifically, dual-branches structure cascades low-level feature maps to mine target object edge regions. Additionally, during inference stage, attention mechanism assigns appropriate attention for different features to preserve non-discriminative areas. Extensive experiments on both ILSVRC and CUB-200-2011 datasets show that the ADBL method achieves substantial performance improvements.
Wenjun Hui, Chuangchuang Tan, Guanghua Gu
MMAsia1