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

Chun Ding

dblp:140/1384 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
6since 2021 · last 2025
0000-0001-7364-215XORCID · reported

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Vision and language · 36% Generative modeling · 36% Video understanding and tracking · 28%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model › image editing
instruction-based image editing
0.912025
RetouchGPT: LLM-based Interactive High-Fidelity Face Retouching via Imperfection Prompting · AAAI 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
RetouchGPT: LLM-based Interactive High-Fidelity Face Retouching via Imperfection Prompting · AAAI 2025
Visual content generation and editing › face editing
face retouching
0.912025
RetouchGPT: LLM-based Interactive High-Fidelity Face Retouching via Imperfection Prompting · AAAI 2025
Visual content generation and editing
image editing
0.912025
RetouchGPT: LLM-based Interactive High-Fidelity Face Retouching via Imperfection Prompting · AAAI 2025
Computer vision › Video understanding and tracking › action recognition
human action recognition
0.712023
Sequential Order-Aware Coding-Based Robust Subspace Clustering for Human Action Recognition in Untrimmed Videos · IEEE Trans. Image Process. 2023
Data mining
clustering
0.712023
Sequential Order-Aware Coding-Based Robust Subspace Clustering for Human Action Recognition in Untrimmed Videos · IEEE Trans. Image Process. 2023
Data mining › clustering › high-dimensional clustering
subspace clustering
0.712023
Sequential Order-Aware Coding-Based Robust Subspace Clustering for Human Action Recognition in Untrimmed Videos · IEEE Trans. Image Process. 2023

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

prompt-based feature modification · 1.7large language model · 1.7sequential order-aware coding · 1.3multi-layer neural network · 1.3affinity graph cutting · 1.3
YearPublicationVenuePosition
2025 RetouchGPT: LLM-based Interactive High-Fidelity Face Retouching via Imperfection Prompting
abstract
Face retouching aims to remove facial imperfections from image and videos while at the same time preserving face attributes. The existing methods are designed to perform non-interactive end-to-end retouching, while the ability to interact with users is highly demanded in downstream applications. In this paper, we propose RetouchGPT, a novel framework that leverages Large Language Models (LLMs) to guide the interactive retouching process. Towards this end, we design an instruction-driven imperfection prediction module to accurately identify imperfections by integrating textual and visual features. To learn imperfection prompts, we further incorporate a LLM-based embedding module to fuse multi-modal conditioning information. The prompt-based feature modification is performed in each transformer block, such that the imperfection features are suppressed and replaced with the features of normal skin progressively. Extensive experiments have been performed to verify effectiveness of our design elements and demonstrate that RetouchGPT is a useful tool for interactive face retouching and achieves superior performance over state-of-the-arts.
Chun Ding, Ruotao Xu, Si Wu 0002, Yong Xu 0007, Hau-San Wong
AAAI2
2025 IP-KGQA: Intent-Aware Prompt Learning for Knowledge Graph Question Answering
abstract
Knowledge Graph Question Answering (KGQA) addresses natural language questions by leveraging structured information stored in knowledge graphs. However, existing KGQA methods are overly concerned with improving the quality of responses by retrieving information, neglecting to identify which type of knowledge is truly useful to optimize the performance of the KGQA system, resulting in redundant retrieval. At the same time, these methods have limitations in aligning user intent and insufficient semantic richness in responses. In this work, we propose IP-KGQA, which introduce a intent-aware prompt learning scheme for KGQA framework. A Selection-Driven Efficient Retrieval (SER) module is incorporated in the framework, which classifies user questions to ensure that only long-tail questions are directed to the knowledge graph retrieval to enhance system efficiency. To filter and select the most relevant triplets, aligning retrieved information more closely with user intent, we introduce the User Intent-aware Filtering (UIF) module, where Monte Carlo sampling is applied to obtain the optimal triplets. The Domain-specific Context Prompt Extension (DCPE) module is utilized in collaboration with a fine-tuned large language model (LLM) to integrate domain-specific knowledge into the responses, ensuring that the answers are enriched in terms of semantic quality. Extensive experiments have been conducted on the CommonSenseQA and TriviaQA datasets, which demonstrate that IP-KGQA outperforms the existing methods in terms of retrieval efficiency, answer accuracy and user intent alignment.
Zheng Dai, Chun Ding, Si Wu 0002, Yong Xu 0007, Runzhe Liang, Tianshi Xu, Yedong Li, Dapeng Oliver Wu
ICME2
2025 Adversarial Style Interpolation for High-fidelity Stroke-aware Chinese Character Image Synthesis
abstract
As a specific image-to-image translation task, Chinese character style transfer aims to synthesize new character images with the style of reference characters and the content of target ones. This task is still challenging due to the significant number of characters with complex structures. We present an Adversarial Style Interpolation-based approach for reliable Style Transfer (ASIST). To capture style information from reference images, we adopt a style predictor to compete with a style encoder and a generator by predicting the interpolation coefficients of the character images synthesized from the interpolated style features. Further, we incorporate a stroke-aware content predictor, which applies attention on local strokes regardless of the variance in style. By jointly optimized with the content predictor, the generator is able to attend on the structural integrity of synthesized characters. Extensive experiments are performed to verify that the proposed approach can synthesize high-quality stylized Chinese characters over the leading methods.
Chun Ding, Si Wu 0002
IJCNN2
2023 Siamese transformer network-based similarity metric learning for cross-source remote sensing image retrieval
Chun Ding, Meimin Wang, Zhili Zhou 0001, Teng Huang 0001, Xiaoliang Wang 0002, Jin Li 0002
Neural Comput. Appl.1
2023 Sequential Order-Aware Coding-Based Robust Subspace Clustering for Human Action Recognition in Untrimmed Videos
abstract
Human action recognition (HAR) is one of most important tasks in video analysis. Since video clips distributed on networks are usually untrimmed, it is required to accurately segment a given untrimmed video into a set of action segments for HAR. As an unsupervised temporal segmentation technology, subspace clustering learns the codes from each video to construct an affinity graph, and then cuts the affinity graph to cluster the video into a set of action segments. However, most of the existing subspace clustering schemes not only ignore the sequential information of frames in code learning, but also the negative effects of noises when cutting the affinity graph, which lead to inferior performance. To address these issues, we propose a sequential order-aware coding-based robust subspace clustering (SOAC-RSC) scheme for HAR. By feeding the motion features of video frames into multi-layer neural networks, two expressive code matrices are learned in a sequential order-aware manner from unconstrained and constrained videos, respectively, to construct the corresponding affinity graphs. Then, with the consideration of the existence of noise effects, a simple yet robust cutting algorithm is proposed to cut the constructed affinity graphs to accurately obtain the action segments for HAR. The extensive experiments demonstrate the proposed SOAC-RSC scheme achieves the state-of-the-art performance on the datasets of Keck Gesture and Weizmann, and provides competitive performance on the other 6 public datasets such as UCF101 and URADL for HAR task, compared to the recent related approaches.
Zhili Zhou 0001, Chun Ding, Jin Li 0002, Eman Mohammadi, Guangcan Liu, Yimin Yang 0001, Q. M. Jonathan Wu
IEEE Trans. Image Process.2
2022 Spatio-Temporal Feature Encoding for Traffic Accident Detection in VANET Environment
abstract
In the Vehicular Ad hoc Networks (VANET) environment, recognizing traffic accident events in the driving videos captured by vehicle-mounted cameras is an essential task. Generally, traffic accidents have a short duration in driving videos, and the backgrounds of driving videos are dynamic and complex. These make traffic accident detection quite challenging. To effectively and efficiently detect accidents from the driving videos, we propose an accident detection approach based on spatio–temporal feature encoding with a multilayer neural network. Specifically, the multilayer neural network is used to encode the temporal features of video for clustering the video frames. From the obtained frame clusters, we detect the border frames as the potential accident frames. Then, we capture and encode the spatial relationships of the objects detected from these potential accident frames to confirm whether these frames are accident frames. The extensive experiments demonstrate that the proposed approach achieves promising detection accuracy and efficiency for traffic accident detection, and meets the real-time detection requirement in the VANET environment.
Zhili Zhou 0001, Xiaohua Dong, Zhetao Li, Keping Yu, Chun Ding, Yimin Yang 0001
IEEE Trans. Intell. Transp. Syst.5
2014 Adaptive learning algorithm of self-organizing teams
Jing Li 0044, Chun Ding
Expert Syst. Appl.2