Min Li 0021

dblp:82/0-21 · DBLP profile ↗
← Back
16ranked-venue papers
2as first author
14since 2021 · last 2026
0000-0002-1259-6441ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-author · 5 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021Computer networks · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2026 FedTrustAug: Federated sparse trust augmentation for service recommendation
Maolan Zhang, Di Xiao 0001, Min Li 0021, Lvjun Chen, Zhuyang Yu
Eng. Appl. Artif. Intell.3
2025 Fog-driven communication-efficient and privacy-preserving federated learning based on compressed sensing
Hui Huang 0008, Di Xiao 0001, Mengdi Wang 0005, Min Li 0021, Lvjun Chen, Yanqi Liu
Comput. Networks5
2025 ACPP-MIH: A robust multiple image hiding framework with adaptive cover image privacy protection
Di Xiao 0001, Lvjun Chen, Min Li 0021
Expert Syst. Appl.4
2025 Communication-privacy-accuracy trade-offs in federated learning for non-IID data with shuffle model
Di Xiao 0001, Xinchun Fan, Lvjun Chen, Min Li 0021, Maolan Zhang
Knowl. Based Syst.4
2025 Adaptive compressed learning boosts both efficiency and utility of differentially private federated learning
Min Li 0021, Di Xiao 0001, Lvjun Chen
Signal Process.1
2024 Manipulable, reversible and diversified de-identification via face identity disentanglement
Di Xiao 0001, Jingdong Xia, Min Li 0021, Maolan Zhang
Multim. Tools Appl.3
2024 Hierarchically Fair and Differentially Private Federated Learning in Industrial IoT Based on Compressed Sensing With Adaptive-Thresholding Sparsification
abstract
Federated learning (FL) enables decentralized industrial-Internet-of-Things devices (also called clients) to share model parameters to build a joint model. Fair rewards, security of shared data, and transmission cost are the important factors that influence clients to participate in FL. Few existing works can solve these problems at the same time. Therefore, we propose a hierarchically fair and differentially private federated learning (HFDPFL), which regards the model itself as a reward to promote fairness. Reputation is used to measure the client's contribution to FL, and clients with high reputation will be rewarded with high accuracy models. In order to ensure the security of the shared data and reduce communication overhead, we implement differentially private gradient compression based on compressed sensing, which achieves differential privacy protection of gradients and improves communication efficiency. Extensive experiments are conducted to demonstrate the superiority of HFDPFL in terms of fairness, privacy preserving, and communication efficiency.
Xue Tan, Di Xiao 0001, Hui Huang 0008, Mengdi Wang 0005, Min Li 0021
IEEE Trans. Ind. Informatics5
2024 Prior-based privacy-assured compressed sensing scheme in cloud
Hui Huang 0008, Di Xiao 0001, Min Li 0021
Vis. Comput.4
2023 Robust Watermarking Scheme in Encrypted Domain Based on Integer Lifting Wavelet Transform and Compressed Sensing
abstract
Watermarking schemes in plaintext domain usually suffer from high exposure risk of the cover signal. Data hiding in encrypted image (DHEI) can guarantee the security of the cover signal by embedding secret information into encrypted signal. Based on the above, we propose a robust watermarking scheme in encrypted domain based on integer lifting wavelet transform (LWT) and compressed sensing (CS). Firstly, the signal owner uses Kronecker CS progressive reconstruction and global random permutation (GRP) to realize the reserving room and encryption. Subsequently, the watermark is preprocessed by integer LWT, and compressed by CS. Then, the watermark is embedded by multiple embedding method (MEM) and most significant bits (MSBs) replacement in the cover signal. Experiments show that the proposed scheme can extract the watermark stably under a variety of attacks while the cover signal achieves satisfactory reconstruction.
Di Xiao 0001, Aozhu Zhao, Min Li 0021
ICASSP4
2023 Privacy-Preserving Federated Compressed Learning Against Data Reconstruction Attacks Based on Secure Data
Di Xiao 0001, Jinkun Li, Min Li 0021
ICONIP (15)3
2023 Multilevel Privacy Preservation Scheme Based on Compressed Sensing
abstract
Although the extensive application of the Internet of Things brings great convenience, it raises the concern of privacy leakage in the processes of data acquisition, analyzing, and sharing as well. In this article, multilevel privacy protection via compressed sensing (CS) is proposed, which has the advantages of compressed sampling, protection of data privacy, and controllability of data access. At the data acquisition end, the CS technique suitable for a resource-constrained environment is employed to sample and encrypt signals with the assistance of discriminant component analysis. Then, the encrypted data will be transmitted to the cloud in time. On the cloud service, signals protected by CS rarely disclose private information to malicious attackers, and they will be accessed by two-class authorized entities. One is the semiauthorized user with low privilege who can only get the features from encrypted data for the subsequent inference; the other is the full-authorized user who is capable of reconstructing the original data. We demonstrate the scheme through two case studies of a face recognition system and a human activity recognition system and analyze its performance.
Di Xiao 0001, Hui Huang 0008, Min Li 0021
IEEE Trans. Ind. Informatics4
2022 Privacy-Assured and Multi-Prior Recovered Compressed Sensing for Image Compression-Encryption Applications
abstract
Compressed sensing (CS), a popular signal processing technique, can achieve compression and encryption simultaneously. Therefore, it has extension applications in various fields. However, CS is vulnerable to cryptographic attacks for its linear encoding process. To solve this problem, a permutation-diffusion structure is designed and embedded to the CS encoding process. In addition, it can increase the key space while compressing. Since the permutation-diffusion structure reduces the sparseness, superior recovery performance cannot be achieved. Therefore, the multi-prior regularization recovery strategy is designed to improve the recovery performance, where the multi-prior regularization term denotes l1 norm, total variation (TV) and low rank. The simulation results and analyses demonstrate that the proposed encoding scheme can resist cryptographic attacks, increase the key space while compressing, and achieve 1.54dB PSNR gain on average in comparison with the existing schemes.
Hui Huang 0008, Di Xiao 0001, Min Li 0021
DCC3
2022 Communication-Efficient and Secure Federated Learning Based on Adaptive One-Bit Compressed Sensing
Di Xiao 0001, Xue Tan, Min Li 0021
ISC3
2022 Multi-level video quality services and security guarantees based on compressive sensing in sensor-cloud system
Min Li 0021, Di Xiao 0001, Hui Huang 0008, Bo Zhang 0030
J. Netw. Comput. Appl.1
2020 Low-cost and high-efficiency privacy-protection scheme for distributed compressive video sensing in wireless multimedia sensor networks
Di Xiao 0001, Min Li 0021, Mengdi Wang 0005
J. Netw. Comput. Appl.2
2019 A visually secure image encryption scheme based on parallel compressive sensing
Hui Wang 0050, Di Xiao 0001, Min Li 0021, Yanping Xiang
Signal Process.3