检索结果-内蒙古大学图书馆

Output-Constrained Lossy source coding With Application to Rate-Distortion-Perception Theory

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第3期73卷 1801-1815页

作者： Xie, Li Li, Liangyan Chen, Jun Zhang, Zhongshan Beijing Inst Technol Sch Informat & Elect Beijing 100081 Peoples R China McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada Beijing Inst Technol Sch Cyberspace Sci & Technol Beijing 100081 Peoples R China

The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of the squared error distortion measure. An explicit expression is obtained when both the source and reconstruction distributions are Gaussian. This further leads to a partial characterization of the information-theoretic limit of quadratic Gaussian rate-distortion-perception coding, with the perception measure given by either the Kullback-Leibler divergence or the squared quadratic Wasserstein distance, from which Wagner's result for the perfect realism setting and Zhang et al.'s result for the unlimited common randomness setting can be recovered as special cases.

关键词： Distortion source coding Image reconstruction Distortion measurement Loss measurement Image coding Decoding Kullback-Leibler divergence optimal transport output-constrained source coding rate-distortion-perception theory squared error Wasserstein distance

来源：评论

学校读者我要写书评

暂无评论

D²-JSCC: Digital Deep Joint source-Channel coding for Semantic Communications

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2025年第4期43卷 1246-1261页

作者： Huang, Jianhao Yuan, Kai Huang, Chuan Huang, Kaibin Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Future Network Intelligence Inst Shenzhen 518172 Peoples R China

Semantic communications (SemCom) have emerged as a new paradigm for supporting sixth-generation applications, where semantic features of data are transmitted using artificial intelligence algorithms to attain high communication efficiencies. Most existing SemCom techniques utilize deep neural networks (DNNs) to implement analog source-channel mappings, which are incompatible with existing digital communication architectures. To address this issue, this paper proposes a novel framework of digital deep joint source-channel coding (D-2-JSCC) targeting image transmission in SemCom. The framework features digital source and channel codings that are jointly optimized to reduce the end-to-end (E2E) distortion. First, deep source coding with an adaptive prior model is designed to encode semantic features according to their distributions. Second, channel coding is employed to protect encoded features against channel distortion. To facilitate their joint design, the E2E distortion is characterized as a function of the source and channel rates via the analysis of the Bayesian model and Lipschitz assumption on the DNNs. Then to minimize the E2E distortion, a two-step algorithm is proposed to control the source-channel rates for a given channel signal-to-noise ratio. Simulation results reveal that the proposed framework outperforms classic deep JSCC and mitigates the cliff and leveling-off effects, which commonly exist for separation-based approaches.

关键词： Distortion Channel coding source coding Semantics Decoding Signal to noise ratio Symbols Optimization Adaptation models Image coding Semantic communications digital deep joint source-channel coding deep learning deep source coding joint source-channel rate control

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware source coding for Talking-Head Video with Adaptive Keypoints

Semantic-Aware Source Coding for Talking-Head Video with Ada...

引用

IEEE Conference on Wireless Communications and Networking

作者： Zhao Jing Zhisong Bie Haobo Lei Jiali Wang Yichen Zhi Hongxia Bie School of Artificial Intelligence BUPT Beijing China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The dense motion semantics in talking-head videos can be encoded as sparse keypoints for low-bitrate semantic source coding. Previous methods extracted keypoints that describe fixed part semantics from faces, typically at the eyes, nose, and mouth. However, these fixed keypoints cannot be adaptively adjusted according to varied videos, limiting the efficiency of source coding. In this paper, we propose adaptive keypoints that perceptively express facial movements for flexible talking-head semantic source coding. The superiority of the adaptive keypoints is theoretically substantiated through likelihood functions. To achieve adaptive keypoint extraction, we designed a detector with a transformer architecture and regression layers, allowing keypoints sampled from the global context to not be confined to fixed areas of the face, breaking the conventional understanding of keypoints. Additionally, we can adjust the bitrate according to the number of keypoints, achieving flexible source coding. Extensive experiments demonstrate that our semantic source coding approach achieves better rate-distortion performance than existing state-of-the-art methods.

关键词： Adaptive systems source coding Semantics Bit rate Detectors Transformers Feature extraction Faces Videos Maximum likelihood decoding

来源：评论

学校读者我要写书评

暂无评论

Enhanced Practical Integer-Forcing source coding

Enhanced Practical Integer-Forcing Source Coding

引用

International ITG Conference on source and Channel coding (SCC)

作者： Rebekka Schulz Sebastian Stern Robert F.H. Fischer Institute of Communications Engineering Ulm University Germany

ISBN: (数字)9798331522896

ISBN: (纸本)9798331522902

This work considers one-shot integer-forcing source coding (IFSC), where the quantization and modulo reduction are done according to scaled integer lattices. This variant shows a loss in performance compared to IFSC employing high-dimensional lattices, which is caused by residual errors due to the modulo reduction. To overcome this problem, we propose an individual scaling of the symbols before quantization to reduce this overload error probability. We develop an algorithm to find the optimal preprocessing based on gradient descent. Additionally, numerical simulation results are presented to illustrate the theoretical findings. It is shown that already this simple scaling can achieve significant gains at only little additional cost in the calculation of the required matrices.

关键词： Quantization (signal) Costs Error probability source coding Lattices Symbols Receivers Numerical simulation Decoding

来源：评论

学校读者我要写书评

暂无评论

Novel Double Protograph LDPC Codes for Joint source-Channel coding Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2025年第4期74卷 5291-5306页

作者： Zhan, Jia Tam, Wai-Man Lau, Francis C. M. Hong Kong Polytech Univ Dept Elect & Elect Engn Hong Kong 999077 Peoples R China Guangdong Univ Technol Guangzhou 510006 Peoples R China

In this paper, we first propose a novel joint source-channel block code (JSC-BC) in which two protograph-based low-density parity-check (P-LDPC) block codes are connected not only by a source-variable-channel-check (SVCC) linking matrix, but also by a source-check-channel-variable (SCCV) linking matrix that consists of a zero matrix and a lower or upper triangular (base) matrix with "1"s on its diagonal. Also, we simplify the traditional joint protograph extrinsic information transfer (JP-EXIT) algorithm and propose an "untransmitted protograph-based EXIT (UP-EXIT) algorithm" for calculating the source threshold of a JSC-BC. The proposed UP-EXIT algorithm is more efficient because a smaller protograph consisting of only the untransmitted VNs (i.e., the source VNs and the punctured channel VNs) and their connected check nodes need to be considered. By using the UP-EXIT algorithm, we search for candidate codes with high source thresholds. Then, we select those among the candidate codes also with low channel thresholds. Theoretical and simulation results show that the newly constructed codes outperform state-of-the-art double P-LDPC (DP-LDPC) block codes. Furthermore, we spatially couple the joint source-channel block code and obtain a spatially coupled joint source-channel code (SC-JSCC). Theoretical analyses and simulation results show that even with a smaller window size and lower decoding complexity, the SC-JSCC with the spatially coupled structure for each sub-block (source protomatrix, channel protomatrix, SCCV linking matrix, and SVCC linking matrix) can achieve better error performance than existing spatially-coupled DP-LDPC codes.

关键词： Codes Parity check codes Joining processes Block codes source coding Simulation Entropy Decoding Optimization Image coding Joint source-channel block code (JSC-BC) joint source-channel code (JSCC) SC-DP-LDPC SC-JSCC spatially coupled SVCC

来源：评论

学校读者我要写书评

暂无评论

source-coding AND TRANSMISSION OF HDTV IMAGES COMPRESSED WITH THE WAVELET TRANSFORM

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1993年第1期11卷 46-58页

作者： ARGENTI, F BENELLI, G MECOCCI, A UNIV PAVIA DEPT ELECTR ENGN I-27100 PAVIA ITALY

Digital high-definition TV (HDTV) signals are generally compressed to reduce transmission bandwidth requirements. This paper presents a compression algorithm for the bit rate reduction of an HDTV image using the wavelet transform. The major problems related to the transmission of a compressed HDTV signal are analyzed. Transmission is examined both on a noisy channel and an asynchronous transfer mode (ATM) network. The effects of channel noise on the reconstructed image are determined, and a solution to mitigate the degradation of the image quality is presented. Lastly, a model for the output bit rate of the HDTV coder is derived and used to simulate the transmission of an ATM multiplexer so that the network's main performance parameters can be determined.

关键词： wavelets source coding noisy channel channel noise wavelet transforms characteristic parameter Image quality COMPRESSED bit rate reduction Compression algorithms

来源：评论

学校读者我要写书评

暂无评论

source coding With a Listening-Helper

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第4期69卷 2135-2151页

作者： Bross, Shraga I. Bar Ilan Univ Fac Engn Ramat Gan Israel

We consider the cooperative coding of a pair of correlated memoryless source and side-information sequences wherein an encoder assisted by a side-information aided listening-helper describe the source and side-information to a receiver. We obtain a single-letter characterization of the rate region in both cases: when the decoder reconstructs just the source and when it reconstructs both the source and side-information. In the quadratic Gaussian setting we determine the optimal law characterizing the rate region using a technique introduced by Courtade in combination with a conditional version of the converse for the Gaussian CEO problem.

关键词： Decoding Distortion Markov processes source coding Random variables Distortion measurement Indexes Multi-terminal source coding non-causal helper non-causal side-information cooperation

来源：评论

学校读者我要写书评

暂无评论

source-coding BY CLASSIFICATION - 91-715

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1995年第11期43卷 2821-2832页

作者： VOGEL, P PHILIPS KOMMUN IND AG W-8500 NURNBERGGERMANY

Adaptive source coding is investigated which is performed by a blockwise classification of the source symbols and selection of a coder depending on the class. As justification for adaptive coding, an upper bound is used for the rate distortion function of a stationary source depending on blockwise classification. The main result of the paper states that classification is appropriate to exploit statistical dependencies other than correlation. Such statistical dependencies are described for the prediction error of a coding scheme for moving pictures at 64 kbit/s and are exploited for upper bounding the rate distortion function of the prediction error and improving the coding scheme.

关键词： source coding Resource description framework Rate-distortion Upper bound Switches Quantization Image reconstruction Adaptive coding Speech coding Image communication

来源：评论

学校读者我要写书评

暂无评论

source coding Based Millimeter-Wave Channel Estimation With Deep Learning Based Decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第7期69卷 4751-4766页

作者： Shabara, Yahia Ekici, Eylem Koksal, Can Emre Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA

The speed at which millimeter-Wave (mmWave) channel estimation can be carried out is critical for the adoption of mmWave technologies. This is particularly crucial because mmWave transceivers are equipped with large antenna arrays to combat severe path losses, which consequently creates large channel matrices, whose estimation may incur significant overhead. This paper focuses on the mmWave channel estimation problem. Our objective is to reduce the number of measurements required to reliably estimate the channel. Specifically, channel estimation is posed as a "source compression" problem in which measurements mimic an encoded (compressed) version of the channel. Decoding the observed measurements, a task which is traditionally computationally intensive, is performed using a deep-learning-based approach, facilitating a high-performance channel discovery. Our solution not only outperforms state-of-the-art compressed sensing methods, but it also determines the lower bound on the number of measurements required for reliable channel discovery.

关键词： Millimeter-wave channel estimation path discovery sparse recovery source coding machine learning

来源：评论

学校读者我要写书评

暂无评论

source coding With a Side Information "Vending Machine"

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第7期57卷 4530-4544页

作者： Permuter, Haim H. Weissman, Tsachy Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel Stanford Univ Dept Elect Engn Stanford CA 94305 USA

We study source coding in the presence of side information, when the system can take actions that affect the availability, quality, or nature of the side information. We begin by extending the Wyner-Ziv problem of source coding with decoder side information to the case where the decoder is allowed to choose actions affecting the side information. We then consider the setting where actions are taken by the encoder, based on its observation of the source. Actions may have costs that are commensurate with the quality of the side information they yield, and an overall per-symbol cost constraint may be imposed. We characterize the achievable tradeoffs between rate, distortion, and cost in some of these problem settings. Among our findings is the fact that even in the absence of a cost constraint, greedily choosing the action associated with the "best" side information is, in general, suboptimal. A few examples are worked out.

关键词： Actions data acquisition rate distortion side information source coding vending machine Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：