Yuling Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yuling Liu has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
Guojiang Xin
Hunan University of Chinese Medicine
3 shared publicationsJingwen Wang
Elizabethtown Coll, Dept Comp Sci, Elizabethtown, PA 17022 USA
3 shared publications- Xin Liao
Hunan University
3 shared publications - Jianye Yang
Guangzhou University
2 shared publications Jie Wang
Richard Miner School of Computer & Information Sciences , University of Massachusetts, Lowell, MA , USA
2 shared publications- Lingyun Xiang
Changsha University of Science and Technology
2 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 12 (6) , 2197-2209
Cross-Modal Inconsistent Information-Based Network for Fake News Detection
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 12 (6) , 2197-2209
Cross-Modal Inconsistent Information-Based Network for Fake News Detection
- 19 July 2026
- Published by Springer Nature
- p. 48-60
Modeling Cross-Paragraph Consistency for Few-Shot AI-Generated Text Detection: A Dual-Path Framework
- 19 July 2026
- Published by Springer Nature
- p. 48-60
Modeling Cross-Paragraph Consistency for Few-Shot AI-Generated Text Detection: A Dual-Path Framework
- 25 August 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 94
Reversible natural language watermarking with augmented word prediction and compression
- 25 August 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 94
Reversible natural language watermarking with augmented word prediction and compression
- 20 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 6 (4) , 921-933
DGeC: Dynamically and Globally Enhanced Convolution
We explore the reasons for the poorer feature extraction ability of vanilla convolution and discover that there mainly exist three key factors that restrict its representation capability, i.e. regular sampling, static aggregation and limited receptive field. With the cost of extra parameters and computations, existing approaches merely alleviate part of the limitations. It drives us to seek a more lightweight operator to further improve the extracted image features. Through a closer examination of the convolution process, we discover that it is composed of two distinct interactions: spatial-wise interaction and channel-wise interaction. Based on this discovery, we decouple the convolutional blocks into these two interactions which not only reduces the parameters and computations but also enables a richer ensemble of interactions. Then, we propose the Dynamically and Globally Enhanced Convolution (DGeC), which includes several components as follows: a Dynamic Area Perceptor block (DAP) that dynamically samples spatial cues, an Adaptive Global Context block (AGC) that introduces the location-aware global image information, and a Channel Attention Perceptor block (CAP) that merges different channel-wise features. The experiments on ImageNet for image classification and on COCO-2017 for object detection validate the effectiveness of DGeC. As a result, our proposed method consistently improves the performance with fewer parameters and computations. In particular, DGeC achieves a 3.1% improvement in top-1 accuracy on ImageNet dataset compared to ResNet50. Moreover, with Faster RCNN and RetinaNet, our DGeC-ResNet50 also consistently outperforms ResNet and ResNeXt.
- 20 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 6 (4) , 921-933
DGeC: Dynamically and Globally Enhanced Convolution
We explore the reasons for the poorer feature extraction ability of vanilla convolution and discover that there mainly exist three key factors that restrict its representation capability, i.e. regular sampling, static aggregation and limited receptive field. With the cost of extra parameters and computations, existing approaches merely alleviate part of the limitations. It drives us to seek a more lightweight operator to further improve the extracted image features. Through a closer examination of the convolution process, we discover that it is composed of two distinct interactions: spatial-wise interaction and channel-wise interaction. Based on this discovery, we decouple the convolutional blocks into these two interactions which not only reduces the parameters and computations but also enables a richer ensemble of interactions. Then, we propose the Dynamically and Globally Enhanced Convolution (DGeC), which includes several components as follows: a Dynamic Area Perceptor block (DAP) that dynamically samples spatial cues, an Adaptive Global Context block (AGC) that introduces the location-aware global image information, and a Channel Attention Perceptor block (CAP) that merges different channel-wise features. The experiments on ImageNet for image classification and on COCO-2017 for object detection validate the effectiveness of DGeC. As a result, our proposed method consistently improves the performance with fewer parameters and computations. In particular, DGeC achieves a 3.1% improvement in top-1 accuracy on ImageNet dataset compared to ResNet50. Moreover, with Faster RCNN and RetinaNet, our DGeC-ResNet50 also consistently outperforms ResNet and ResNeXt.
- 16 September 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (12) , 3196-3206
Efficient object detector via dynamic prior and dynamic feature fusion
Sparse R-CNN is a new paradigm of object detection, which predicts objects in a sparse way. However, there are some limitations in Sparse R-CNN. One is the presence of weak prior information caused by fixed learnable proposal boxes and features across different images, necessitating excessive iterations for the model to refine its predictions; the other is the inadequate exploitation of multi-scale information, leading to the sub-optimal detection performance. Thus, building upon Sparse R-CNN, we propose an efficient detector that incorporates dynamic prior and dynamic feature fusion, called $D^{2}$-Det. In particular, for the dynamic prior part, a prior information generator module dynamically generates proposal features and boxes as the dynamic prior for different images to alleviate the inference-inefficient iterative refinement process of predictions, and we further propose the class scores decoupling method to reduce the computation overhead. Furthermore, for the dynamic feature fusion part, we develop a novel lightweight multi-scale feature fusion module, which dynamically aggregates features from all layers for each proposal box, enabling adaptive feature fusion and improving detection precision by nearly 2 AP. Experiments show that $D^{2}$-Det can achieve 46.6 AP on COCO 2017 with fewer computations for the backbone ResNet50, surpassing most of the state-of-the-art detectors.
- 16 September 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (12) , 3196-3206
Efficient object detector via dynamic prior and dynamic feature fusion
Sparse R-CNN is a new paradigm of object detection, which predicts objects in a sparse way. However, there are some limitations in Sparse R-CNN. One is the presence of weak prior information caused by fixed learnable proposal boxes and features across different images, necessitating excessive iterations for the model to refine its predictions; the other is the inadequate exploitation of multi-scale information, leading to the sub-optimal detection performance. Thus, building upon Sparse R-CNN, we propose an efficient detector that incorporates dynamic prior and dynamic feature fusion, called $D^{2}$-Det. In particular, for the dynamic prior part, a prior information generator module dynamically generates proposal features and boxes as the dynamic prior for different images to alleviate the inference-inefficient iterative refinement process of predictions, and we further propose the class scores decoupling method to reduce the computation overhead. Furthermore, for the dynamic feature fusion part, we develop a novel lightweight multi-scale feature fusion module, which dynamically aggregates features from all layers for each proposal box, enabling adaptive feature fusion and improving detection precision by nearly 2 AP. Experiments show that $D^{2}$-Det can achieve 46.6 AP on COCO 2017 with fewer computations for the backbone ResNet50, surpassing most of the state-of-the-art detectors.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (3) , 4412-4425
Generative Steganography via Live Comments on Streaming Video Frames
Generative text steganography has received considerable attention in the covert communication community for the benefit of sending secret messages without the need to modify carriers. Existing methods typically choose the next word when generating a stego-text based on conditional probability encoding of candidates, which may lead to generating inadequate words for the underlying secret message. How to generate a semantically controllable stego-text with a high capacity on secure embedding of a secret message is a main challenge. We address this challenge by proposing a new paradigm to generative text steganography that takes advantage of certain social media through apparently normal behaviors from the sender. In particular, we make use of the live commenting feature provided by public video sharing platforms (PVSPs), which allow viewers to make comments on video scenes that will fly on screens when the scenes are shown. We show that this feature can be used to construct a generative steganographic system. The sender generates at random a number of distracting words and a certain invertible matrix called W- d matrix based on the total number of message words and distracting words. The sender then transforms a sequence of indexes of these words to a sequence, selects one or more videos with a sufficiently large number of total frames, and generates a comment on each frame in the sequence. The receiver extracts commented frame indexes, uses the shared stego-key to generate the same W- d matrix as the sender, and obtains the secret message using the inverse of the matrix. The stego-key consists of a vocabulary generator and a W- d matrix generator (WMG) based on pseudorandomly generated numbers. To generate comments on frames that conform to comments made by viewers, we devise a neural ResNet-LSTM model to generate a comment for an input image based on its content. Theoretical analysis shows that commented video frames (CVF) is covert, secure, efficient, and feasible to conceal any message of arbitrary length. We implement CVF and present evaluation results from multiple aspects that our work outperforms the existing stego-methods.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (3) , 4412-4425
Generative Steganography via Live Comments on Streaming Video Frames
Generative text steganography has received considerable attention in the covert communication community for the benefit of sending secret messages without the need to modify carriers. Existing methods typically choose the next word when generating a stego-text based on conditional probability encoding of candidates, which may lead to generating inadequate words for the underlying secret message. How to generate a semantically controllable stego-text with a high capacity on secure embedding of a secret message is a main challenge. We address this challenge by proposing a new paradigm to generative text steganography that takes advantage of certain social media through apparently normal behaviors from the sender. In particular, we make use of the live commenting feature provided by public video sharing platforms (PVSPs), which allow viewers to make comments on video scenes that will fly on screens when the scenes are shown. We show that this feature can be used to construct a generative steganographic system. The sender generates at random a number of distracting words and a certain invertible matrix called W- d matrix based on the total number of message words and distracting words. The sender then transforms a sequence of indexes of these words to a sequence, selects one or more videos with a sufficiently large number of total frames, and generates a comment on each frame in the sequence. The receiver extracts commented frame indexes, uses the shared stego-key to generate the same W- d matrix as the sender, and obtains the secret message using the inverse of the matrix. The stego-key consists of a vocabulary generator and a W- d matrix generator (WMG) based on pseudorandomly generated numbers. To generate comments on frames that conform to comments made by viewers, we devise a neural ResNet-LSTM model to generate a comment for an input image based on its content. Theoretical analysis shows that commented video frames (CVF) is covert, secure, efficient, and feasible to conceal any message of arbitrary length. We implement CVF and present evaluation results from multiple aspects that our work outperforms the existing stego-methods.
- 11 October 2023
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (5) , 1710-1718
Similarity Regression Of Functions In Different Compiled Forms With Neural Attentions On Dual Control-Flow Graphs
Detecting if two functions in different compiled forms are similar has a wide range of applications in software security. We present a method that leverages both semantic and structural features of functions, learned by a neural-net model on the underlying control-flow graphs (CFGs). In particular, we devise a neural function-similarity regressor (NFSR) with attentions on dual CFGs. We train and evaluate NFSR on a dataset consisting of nearly 4 million functions from over 14 900 binary files. Experiments show that NFSR is superior to the SOTA models of SAFE, Gemini and GMN, especially for binary functions with large CFGs. An ablation study shows that attention on dual CFGs plays a significant role in detecting function similarities.
- 11 October 2023
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 67 (5) , 1710-1718
Similarity Regression Of Functions In Different Compiled Forms With Neural Attentions On Dual Control-Flow Graphs
Detecting if two functions in different compiled forms are similar has a wide range of applications in software security. We present a method that leverages both semantic and structural features of functions, learned by a neural-net model on the underlying control-flow graphs (CFGs). In particular, we devise a neural function-similarity regressor (NFSR) with attentions on dual CFGs. We train and evaluate NFSR on a dataset consisting of nearly 4 million functions from over 14 900 binary files. Experiments show that NFSR is superior to the SOTA models of SAFE, Gemini and GMN, especially for binary functions with large CFGs. An ablation study shows that attention on dual CFGs plays a significant role in detecting function similarities.
- 13 February 2023
- Published by Elsevier in Information Processing & Management
- Vol. 60 (3)
CNN-BiLSTM-Attention: A multi-label neural classifier for short texts with a small set of labels
- 13 February 2023
- Published by Elsevier in Information Processing & Management
- Vol. 60 (3)
CNN-BiLSTM-Attention: A multi-label neural classifier for short texts with a small set of labels
- 8 July 2022
- Published by Springer Nature
- p. 81-92
Review of Few-Shot Learning in the Text Domain and the Image Domain
- 8 July 2022
- Published by Springer Nature
- p. 81-92
Review of Few-Shot Learning in the Text Domain and the Image Domain
- 4 July 2022
- Published by Springer Nature
- p. 684-695
Review on Intelligent Processing Technologies of Legal Documents
- 4 July 2022
- Published by Springer Nature
- p. 684-695
Review on Intelligent Processing Technologies of Legal Documents