Multi-View Semantic-Aware Communication: An Information Bottleneck Perspective

This paper investigates the joint source-channel coding (JSCC) problem for semantic-aware communication (SAC) systems with multi-view data sources. We extend the theory of multi-view information bottleneck by incorporating a constraint that characterizes the impact of channel corruption on the recovery of task signals at the receiver, referred to as the multiview information bottleneck with channel protection (MVIB-CP). We propose a computationally efficient optimization framework for calculating the MVIB-CP problem in which a contrastive log-ratio upper bound and a simplified variation approximation solution are introduced to estimate mutual information and approximate the divergence of task signal recovery caused by the noisy channel corruption. The proposed MVIB-CP can investigate the tradeoff of the multi-view source compression and the protection of channel corruptions while the above optimization framework can significantly reduce the computational complexity of addressing the MVIB-CP. We present the optimization algorithm for developing the JSCC schemes in multi-view SAC systems. Extensive experiments are conducted based on realworld multi-view source datasets. Our results show that the MVIB-CP-based JSCC achieves up to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{5. 2 8 \%}$</tex> improvement in task signal recovery accuracy, compared to the classical JSCC solution.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161951
Primary Topic
Cognitive Computing and Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-View Semantic-Aware Communication: An Information Bottleneck Perspective

Wang Ru-long, Yujie Zhou, Yong Xiao, Yingyu Li
Cognitive Computing and Networks
article

Multi-View Semantic-Aware Communication: An Information Bottleneck Perspective

Wang Ru-long, Yujie Zhou, Yong Xiao, Yingyu Li
article en

Abstract

This paper investigates the joint source-channel coding (JSCC) problem for semantic-aware communication (SAC) systems with multi-view data sources. We extend the theory of multi-view information bottleneck by incorporating a constraint that characterizes the impact of channel corruption on the recovery of task signals at the receiver, referred to as the multiview information bottleneck with channel protection (MVIB-CP). We propose a computationally efficient optimization framework for calculating the MVIB-CP problem in which a contrastive log-ratio upper bound and a simplified variation approximation solution are introduced to estimate mutual information and approximate the divergence of task signal recovery caused by the noisy channel corruption. The proposed MVIB-CP can investigate the tradeoff of the multi-view source compression and the protection of channel corruptions while the above optimization framework can significantly reduce the computational complexity of addressing the MVIB-CP. We present the optimization algorithm for developing the JSCC schemes in multi-view SAC systems. Extensive experiments are conducted based on realworld multi-view source datasets. Our results show that the MVIB-CP-based JSCC achieves up to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{5. 2 8 \%}$</tex> improvement in task signal recovery accuracy, compared to the classical JSCC solution.

Huzhou Vocational and Technical College (CN), Huazhong University of Science and Technology (CN)
Openalex Percentile: Top 86%
Cognitive Computing and Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.