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

Lunan Sun

dblp:236/5760 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0009-0009-6628-9314ORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Computer graphics and multimedia
2 papers
Image and video coding · 82% Image and video processing · 18%
Network and information security
1 paper
Privacy and data protection · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding
joint source-channel coding
0.922024
Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image Transmission · IEEE J. Sel. Areas Commun. 2023
Disentangled Information Bottleneck Guided Privacy-Protective Joint Source and Channel Coding for Image Transmission · IEEE Trans. Commun. 2024
Coding theory › source coding › rate-distortion theory
information bottleneck
0.712023
Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image Transmission · IEEE J. Sel. Areas Commun. 2023

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

variational approximation · 1.5maximum entropy principle · 1.5density ratio trick · 1.5information bottleneck · 1.3deep learning · 1.3
YearPublicationVenuePosition
2025 Information Bottleneck Guided Joint Source-Channel Coding with HARQ
abstract
Deep joint source-channel coding (JSCC) with hybrid automatic repeat request (HARQ) for image transmission has attracted increasing attention due to its flexibility and high efficiency. Existing researches mainly focus on minimizing the distortion of mutiple retransmissions while ignoring the redundancy in retransmitted signal and such redundancy may lead bandwidth waste and reconstruction quality degradation. In this paper, we propose an information bottleneck (IB) guided deep JSCC with HARQ system (HARQ-IBJSC), which aims at improving the reconstruction quality by compressing the redundancy in retransmitted signal. In particular, we first design a new IB objective for deep JSCC with HARQ system, which simultaneously reduces redundancy in the retransmitted signal and minimizes image transmission distortion. Since the mutual information terms in the designed IB objective is intractable, we then derive a differentiable lower bound on the IB objective and use the bound as the loss function of HARQ-IBJSC. Experimental results show that the proposed HARQ-IBJSC system can increase PSNR by up to 1 dB.
Haoxuan Zhang, Lunan Sun, Caili Guo, Yang Yang 0057
WCNC2
2024 Privacy-Aware Joint Source-Channel Coding For Image Transmission Based On Disentangled Information Bottleneck
abstract
Current privacy-aware joint source-channel coding (JSCC) works aim at avoiding private information transmission by adversarially training the JSCC encoder and decoder under specific signal-to-noise ratios (SNRs) of eavesdroppers. However, these approaches incur additional computational and storage requirements as multiple neural networks must be trained for various eavesdroppers’ SNRs to determine the transmitted information. To overcome this challenge, we propose a novel privacy-aware JSCC for image transmission based on disentangled information bottleneck (DIB-PAJSCC). In particular, we derive a novel disentangled information bottleneck objective to disentangle private and public information. Given the separate information, the transmitter can transmit only public information to the receiver while minimizing reconstruction distortion. Since DIB-PAJSCC transmits only public information regardless of the eavesdroppers’ SNRs, it can eliminate additional training adapted to eavesdroppers’ SNRs. Experimental results show that DIB-PAJSCC can reduce the eavesdropping accuracy on private information by up to 20% compared to existing methods.
Lunan Sun, Caili Guo, Mingzhe Chen, Yang Yang 0057
ICASSP1
2024 Disentangled Information Bottleneck Guided Privacy-Protective Joint Source and Channel Coding for Image Transmission
abstract
Joint source and channel coding (JSCC) has attracted increasing attention in semantic communications. However, JSCC is vulnerable to privacy issues due to the high relevance between the source image and channel input. In this paper, we propose a disentangled information bottleneck guided privacy-protective JSCC (DPJSCC) for image transmission, which aims at protecting private information and achieving superior image transmission performance. In particular, we propose a disentangled information bottleneck objective to compress the private information in public subcodewords and improve the reconstruction quality simultaneously. To optimize JSCC neural networks using the proposed objective, we derive a differentiable estimation based on variational approximation and the density-ratio trick. Additionally, we design a password-based privacy-protective algorithm that encrypts the private subcodewords, achieving joint optimization with JSCC neural networks. The proposed algorithm involves an encryptor for encrypting private information and a decryptor for recovering it at the legitimate receiver. A loss function is derived based on the maximum entropy principle for jointly training the encryptor, decryptor, and JSCC decoder to maximize eavesdropping uncertainty and improve reconstruction quality. Experimental results show that DPJSCC reduces eavesdropping accuracy on private information by up to 18% and decreases inference time by 10%.
Lunan Sun, Yang Yang 0057, Mingzhe Chen, Caili Guo
IEEE Trans. Commun.1
2023 Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image Transmission
abstract
Joint source and channel coding (JSCC) for image transmission has attracted increasing attention due to its robustness and high efficiency. However, the existing deep JSCC research mainly focuses on minimizing the distortion between the transmitted and received information under a fixed number of available channels. Therefore, the transmitted rate may be far more than its required minimum value. In this paper, an adaptive information bottleneck (IB) guided joint source and channel coding (AIB-JSCC) method is proposed for image transmission. The goal of AIB-JSCC is to reduce the transmission rate while improving the image reconstruction quality. In particular, a new IB objective for image transmission is proposed so as to minimize the distortion and the transmission rate. A mathematically tractable lower bound on the proposed objective is derived, and then, adopted as the loss function of AIB-JSCC. To trade off compression and reconstruction quality, an adaptive algorithm is proposed to adjust the hyperparameter of the proposed loss function dynamically according to the distortion during the training. Experimental results show that AIB-JSCC can significantly reduce the required amount of transmitted data and improve the reconstruction quality and downstream task accuracy.
Lunan Sun, Yang Yang 0057, Mingzhe Chen, Caili Guo, Walid Saad 0001, H. Vincent Poor
IEEE J. Sel. Areas Commun.1