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

Jiarui Deng

dblp:279/9788 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0000-1338-9607ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 since 2021Databases, 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Network and information security
1 paper
Digital forensics and information hiding · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
pattern mining
1.012026
High-Utility Sequential Rule Mining Utilizing Segmentation Guided by Confidence · IEEE Trans. Knowl. Data Eng. 2026
Data mining › pattern mining › sequential pattern mining
sequential rule mining
1.012026
High-Utility Sequential Rule Mining Utilizing Segmentation Guided by Confidence · IEEE Trans. Knowl. Data Eng. 2026
Digital forensics and information hiding › watermarking
audio watermarking
0.812024
A Lattice-Based Embedding Method for Reversible Audio Watermarking · IEEE Trans. Dependable Secur. Comput. 2024
Digital forensics and information hiding
watermarking
0.812024
A Lattice-Based Embedding Method for Reversible Audio Watermarking · IEEE Trans. Dependable Secur. Comput. 2024
Coding theory › source coding › quantization › structured vector quantization
lattice quantization
0.212024
A Lattice-Based Embedding Method for Reversible Audio Watermarking · IEEE Trans. Dependable Secur. Comput. 2024

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

quantization index modulation · 1.5meet-in-the-middle embedding · 1.5lattice quantization · 1.5utility-linked table · 1.0reduced remaining utility upper bound · 1.0confidence-guided segmentation · 1.0
YearPublicationVenuePosition
2026 High-Utility Sequential Rule Mining Utilizing Segmentation Guided by Confidence
abstract
Within the domain of data mining, one critical objective is the discovery of sequential rules with high utility. The goal is to discover sequential rules that exhibit both high utility and strong confidence, which are valuable in real-world applications. However, existing high-utility sequential rule mining algorithms suffer from redundant utility computations, as different rules may consist of the same sequence of items. When these items can form multiple distinct rules, additional utility calculations are required. To address this issue, this study proposes a sequential rule mining algorithm that utilizes segmentation guided by confidence (RSC), which employs confidence-guided segmentation to reduce redundant utility computation. It adopts a method that precomputes the confidence of segmented rules by leveraging the support of candidate subsequences in advance. Once the segmentation point is determined, all rules with different antecedents and consequents are generated simultaneously. RSC uses a utility-linked table to accelerate candidate sequence generation and introduces a stricter utility upper bound, called the reduced remaining utility of a sequence, to address sequences with duplicate items. Finally, the proposed RSC method was evaluated on multiple datasets, and the results demonstrate improvements over state-of-the-art approaches.
Chunkai Zhang, Jiarui Deng, Maohua Lyu, Wensheng Gan, Philip S. Yu
IEEE Trans. Knowl. Data Eng.2
2024 A Lattice-Based Embedding Method for Reversible Audio Watermarking
abstract
Existing reversible audio watermarking (RAW) techniques are often vulnerable to intentional or even unintentional attacks on the cover object. This paper proposes a robust RAW scheme based on lattices, which is referred to as Meet-in-the-Middle Embedding (MME). In MME, the lattice quantization errors are properly scaled and added back to the quantized host signals such that the receiver can estimate the cover. Scaling factor serves as a key factor to the reversibility of MME, whose feasible range is rigorously justified. Both theoretically and experimentally, we demonstrate the superiority of MME to improved quantization index modulation (IQIM) in terms of signal-to-watermark ratio (SWR) and generalized signal-to-noise ratio (GSNR). Moreover, simulations show that MME also outperforms other state-of-the-arts in SWR, objective difference grade (ODG), and bit error rate (BER).
Junren Qin, Shanxiang Lyu, Jiarui Deng, Xingyuan Liang, Shijun Xiang, Hao Chen 0029
IEEE Trans. Dependable Secur. Comput.3
2022 CNN Based Target Classification Framework Based on Complex Sparse SAR Image: Initial Result
abstract
Synthetic aperture radar (SAR) is an active surveillance system which is able to work under all-day and all-weather conditions. Due to the rapid development of SAR, automatic target recognition (ATR) as one of SAR image applications has become an important research direction in recent years, and its key process is target classification. In this paper, a novel target classification model based on amplitude and phase information of sparse SAR image is proposed. Firstly, we use a novel iterative soft thresholding (BiIST) algorithm to acquire sparse SAR image with better quality than traditional matched filtering (MF)-based SAR image. Moreover, the amplitude and phase information are utilized to classify the targets based on the proposed amplitude-phase convolutional neural network (AP-CNN). Experimental results based on real MSTAR dataset show that AP-CNN performs better than amplitude-based CNN under standard operating conditions (SOC). In the case of limited samples, the performance gap between the proposed network and amplitude-based CNN is more obvious.
Jiarui Deng, Hui Bi 0001
IGARSS1
2021 Sparse SAR Image Based Automatic Target Recognition by YOLO Network
abstract
Different from optical image limited in time and space, sparse synthetic aperture radar (SAR) can obtain high-resolution image in all day and all weather conditions. Thus, SAR image has been widely used in military fields. With rapid development of technology and the growth of data volume, it is obviously impractical to interpret SAR image manually. Therefore, in this paper, we propose a novel sparse SAR automatic target recognition (ATR) framework, which is composed by the regularization sparse recovery algorithm and YOLO networks, so as to identify the SAR target quickly and accurately. In the proposed framework, we first use the complex approximate message passing (CAMP) based sparse image recovery algorithm to construct the sparse SAR image dataset, then identify the SAR targets by YOLOv3 and YOLOv4 networks. Experimental results based on MSTAR dataset validate the proposed framework effectively.
Jiarui Deng, Hui Bi 0001, Yanjie Yin, Xingmeng Lu
IGARSS1