Qing Du

Dr. Qing Du


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2020 in Neural Networks
Verified
Journal Article
Closed access
YGYong Guo
Yong Guo
JCJian Chen
Jian Chen
QDQing Du
Qing Du
AHAnton Van Den Hengel
Anton Van Den Hengel
Qinfeng ShiQinfeng Shi
Qinfeng Shi
MTMingkui Tan
Mingkui Tan

6 November 2023 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
NDNing Ding
Ning Ding
CDChaorui Deng
Chaorui Deng
MTMingkui Tan
Mingkui Tan
QDQing Du
Qing Du
ZGZhiwei Ge
Zhiwei Ge
QWQi Wu
Qi Wu
Image captioning is a core challenge in computer vision, attracting significant attention. Traditional methods prioritize caption quality, often overlooking style control. Our research enhances method controllability, enabling descriptions of varying detail. By integrating a length level embedding into current models, they can produce detailed or concise captions, increasing diversity. We introduce a length-level reranking transformer to correlate image and text complexity, optimizing caption length for informativeness without redundancy. Additionally, with caption length increase, computational complexity grows due to the autoregressive (AR) design of existing methods. To address this, our non-autoregressive (NAR) model maintains constant complexity regardless of caption length. We've developed a training approach that includes refinement sequence training and sequence-level knowledge distillation to close the performance gap between NAR and AR models. In testing, our models set new standards for caption quality on the MS COCO dataset and offer enhanced controllability and diversity. Our NAR model excels over AR models in these aspects and shows greater efficiency with longer captions. With advanced training techniques, our NAR's caption quality rivals that of leading AR models.

30 November 2022 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
MHMengge He
Mengge He
WDWenjing Du
Wenjing Du
ZWZhiquan Wen
Zhiquan Wen
QDQing Du
Qing Du
YXYutong Xie
Yutong Xie
QWQi Wu
Qi Wu
Many real-world video-text tasks involve different levels of granularity to represent local and global information with distinct semantics, such as frames and words, clips and sentences, or videos and paragraphs. Most existing multimodal representation learning methods suffer from limitations: (i) Adopting expert systems or manual design to extract more fine-grained local information (such as objects and actions in a video frame) for supervision may lead to information asymmetry since there may no corresponding information among modalities; (ii) Neglecting the hierarchical nature of the data to aggregate different levels of information from different modalities will cause insufficient representations. To alleviate the above issues, in this paper, we propose a Multi-Granularity Aggregation Transformer (MGAT) for joint video-audio-text representation learning. Specifically, for intra-modality, we first design a multi-granularity transformer module to relieve information asymmetry by making full use of local and global information within a single modality from different perspectives. Then, for inter-modality, we develop an attention-guided aggregation module to fuse audio and video information hierarchically. Last, we align the aggregated information with text information at different hierarchical levels via intra- and inter-modality consistency loss and contrastive loss. With the help of more granularity of information, we are able to obtain a well-performed representation model for a variety of tasks, e.g ., video-paragraph retrieval and video captioning. Extensive experiments on two challenging benchmarks, i.e ., ActivityNet-captions and Youcook2, demonstrate the superiority of our proposed method.

26 January 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
LXLuodi Xie
Luodi Xie
HHHuimin Huang
Huimin Huang
QDQing Du
Qing Du
Nowadays, we use social networks such as Twitter, Facebook, WeChat and Weibo as means to communicate with each other. Social networks have become so indispensable in our everyday life that we cannot imagine what daily life would be like without social networks. Through social networks, we can access friends’ opinions and behaviors easily and are influenced by them in turn. Thus, an effective algorithm to find the top-K influential nodes (the problem of influence maximization) in the social network is critical for various downstream tasks such as viral marketing, anticipating natural hazards, reducing gang violence, public opinion supervision, etc. Solving the problem of influence maximization in real-world propagation scenarios often involves estimating influence strength (influence probability between two nodes), which cannot be observed directly. To estimate influence strength, conventional approaches propose various humanly devised rules to extract features of user interactions, the effectiveness of which heavily depends on domain expert knowledge. Besides, they are often applicable for special scenarios or specific diffusion models. Consequently, they are difficult to generalize into different scenarios and diffusion models. Inspired by the powerful ability of neural networks in the field of representation learning, we designed a hierarchical generative embedding model (HGE) to map nodes into latent space automatically. Then, with the learned latent representation of each node, we proposed a HGE-GA algorithm to predict influence strength and compute the top-K influential nodes. Extensive experiments on real-world attributed networks demonstrate the outstanding superiority of the proposed HGE model and HGE-GA algorithm compared with the state-of-the-art methods, verifying the effectiveness of the proposed model and algorithm.

12 January 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
LXLuodi Xie
Luodi Xie
HHHuimin Huang
Huimin Huang
QDQing Du
Qing Du
Knowledge graph (KG) embedding has been widely studied to obtain low-dimensional representations for entities and relations. It serves as the basis for downstream tasks, such as KG completion and relation extraction. Traditional KG embedding techniques usually represent entities/relations as vectors or tensors, mapping them in different semantic spaces and ignoring the uncertainties. The affinities between entities and relations are ambiguous when they are not embedded in the same latent spaces. In this paper, we incorporate a co-embedding model for KG embedding, which learns low-dimensional representations of both entities and relations in the same semantic space. To address the issue of neglecting uncertainty for KG components, we propose a variational auto-encoder that represents KG components as Gaussian distributions. In addition, compared with previous methods, our method has the advantages of high quality and interpretability. Our experimental results on several benchmark datasets demonstrate our model’s superiority over the state-of-the-art baselines.

20 January 2021 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
CLChunshan Li
Chunshan Li
QDQing Du
Qing Du
XXXiaofei Xu
Xiaofei Xu
JZJinhui Zhu
Jinhui Zhu
Dianhui ChuDianhui Chu
Dianhui Chu