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

International Conference on Image, Video and Signal Processing (IVSP)

作者： Zhou, Junwei Qi, Mingwei Yang, Yanchao Xiong, Shengwu Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China

ISBN: (纸本)9781450361750

Slepian-Wolf problem regards the compression of multiple correlated information sources that do not communicate with each other. In real applications, the information sources such as video sequences are usually with memory where they are interdependent between symbols. Existing researches mainly consider the memory-less sources and employ channel coding to solve the Slepian-Wolf problem. In this paper, we use distributed arithmetic coding instead of channel coding to solve the Slepian-Wolf problem, benefiting the advantages of source coding in memory sources by eliminating redundancy between symbols. The proposed scheme is very competitive comparing to the existing schemes when applied to memory sources. Simulation results show that the proposed scheme has performance gains when applied to the first-order memory sources with the different overlapping factor. We also analyzed the performance applied to the second-order memory sources with different block lengths.

关键词： arithmetic coding Source coding Channel coding Memory Sources distributed arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Q-Ary distributed arithmetic coding for Uniform Q-Ary Sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第1期69卷 47-74页

作者： Fang, Yong Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China

Laplacian distribution is widely used to model the differences between correlated continuous or nonbinary signals, e.g., the predictive residues of videos. Usually, distributed coding of correlated nonbinary sources, e.g., distributed video coding, is implemented by binary or nonbinary Low-Density Parity-Check (LDPC) codes. In this paper, as an alternative, we attempt using nonbinary distributed arithmetic coding (DAC) to implement distributed coding of uniform nonbinary sources with Laplace-distributed correlation. To analyze Q -ary DAC for uniform Q -ary sources, following the methodology developed in our prior work for binary DAC, we define and deduce Coset Cardinality Spectrum (CCS) from both fixed-length and variable-length perspectives, whose physical meanings are explained in detail;while for binary DAC, our prior work totally ignored the subtle difference between these two perspectives. Compared with binary DAC, an important advantage of nonbinary DAC is that, the mapping from source symbols to coding intervals is so flexible that there are many parameters that can be tuned to achieve better performance;while for binary DAC, there are very few tunable parameters, making it very hard to achieve better performance. This paper proposes a simple method to map source symbols onto coding intervals, which results in a very lightweight codec, while possessing a good Manhattan distance distribution. Then this paper deduces the formula of path metrics for decoder design by making use of CCS. All theoretical analyses are perfectly verified by simulation results. Most important, experimental results show that $Q$ -ary DAC achieves significantly better performance than LDPC codes for distributed coding of uniform $Q$ -ary sources with Laplace-distributed correlation.

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding coset cardinality spectrum nonbinary sources

来源：评论

学校读者我要写书评

暂无评论

Image authentication using distributed arithmetic coding

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第12期77卷 15505-15520页

作者： Zhou, Junwei Liu, Fang Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

Image authentication using distributed arithmetic coding (DAC) is studied in this paper. The quantized random projections of the original image are compressed by a DAC encoder and the codeword is taken as the authentication data. With the help of a target image as side information, the DAC decoder could recover the projections. The authentication process is achieved by examining the Euclidean distance between the reconstructed projections and the side information. Compared with existing approaches, the proposed approach has a simpler structure without the help of an additional cryptographic hash function to verify the decoding result. Moreover, the authentication data is more compact with fewer size. Simulation results justify that the proposed approach achieves a comparable performance as existing schemes.

关键词： Security distributed arithmetic coding Image authentication distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Two Applications of Coset Cardinality Spectrum of distributed arithmetic coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第12期67卷 8335-8350页

作者： Fang, Yong Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Shaanxi Peoples R China

distributed arithmetic coding (DAC) is a practical realization of Slepian-Wolf coding that partitions source space into cosets. Coset Cardinality Spectrum (CCS) is an important property of DAC that was defined in our previous work. In this paper, we give two applications of CCS. First, we find that DAC bitstream is not compact. The rate loss of DAC bitstream is caused by two factors: unequal coset partitioning and bit indivisibility. It is proved that as code length goes to infinity, the expected value of bit-indivisibility rate loss will tend to 0.5 for any irrational Rate Change Step (RCS), where the RCS refers to the rate change when one source bit is flipped. With the help of CCS, the bit-indivisibility rate loss can be compensated to some extend. Especially, for any irrational RCS, as code length goes to infinity, the expected value of the remaining bit-indivisibility rate loss after compensation will tend to about 0.47. The second application of CCS is DAC decoder design. We derive the formula of path metric and find that in the original paper on DAC, the intuitive formula of path metric is not correct. The backward-replacing algorithm is proposed to make full use of memory. Experimental results confirm the correctness of theoretical analyses.

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding coset cardinality spectrum max a posteriori decoding

来源：评论

学校读者我要写书评

暂无评论

Codebook Cardinality Spectrum of distributed arithmetic coding for Independent and Identically-distributed Binary Sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第10期66卷 6580-6596页

作者： Fang, Yong Stankovic, Vladimir Changan Univ Sch Informat Engn Xian 710064 Peoples R China Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf coding, distributed arithmetic coding (DAC) outperforms traditional Low-Density Parity-Check (LPDC) codes for short code length and biased sources. This fact triggers research efforts into theoretical analysis of DAC. In our previous work, we proposed two analytical tools, Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum, to analyze DAC for independent and identically-distributed (i.i.d.) binary sources with uniform distribution. This article extends our work on CCS from uniform i.i.d. binary sources to biased i.i.d. binary sources. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this article is that the final CCS of biased i.i.d. binary sources is not uniformly distributed over [0, 1). This article derives the final CCS of biased i.i.d. binary sources and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results.

关键词： Decoding Parity check codes Channel coding Correlation Complexity theory Estimation distributed source coding Slepian-Wolf coding distributed arithmetic coding codebook cardinality spectrum biased sources

来源：评论

学校读者我要写书评

暂无评论

Error Probability of distributed arithmetic coding

引用

IEEE COMMUNICATIONS LETTERS 2021年第12期25卷 3814-3818页

作者： Fang, Yong Yang, Nan Chen, Jun Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

distributed arithmetic coding (DAC) is an interesting realization of Slepian-Wolf coding that performs nonlinear coset-like partition for equiprobable binary sources. Just as in other coding problems, it is a very important issue to theoretically predict the decoding error probability of DAC. This letter proposes a plausible solution to this difficult issue. Our analyses are based on the concept of coexisting interval introduced in our previous work. Specifically, we use it to deduce the probability that two given codewords coexist in the same coset. Experimental results confirm the correctness of our theoretical analyses.

关键词： Decoding Error probability arithmetic Encoding Codes Hamming distance Tools distributed arithmetic coding Slepian-Wolf coding coexisting interval frame error rate

来源：评论

学校读者我要写书评

暂无评论

Approximation of Initial Coset Cardinality Spectrum of distributed arithmetic coding for Uniform Binary Sources

引用

IEEE COMMUNICATIONS LETTERS 2023年第1期27卷 65-69页

作者： Yang, Nan Fang, Yong Wang, Lin Wang, Zhipeng Jiang, Fan Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China Xiamen Univ Dept Commun Engn Xiamen 361005 Peoples R China Beihang Univ Sch Elect Informat Engn Beijing 100191 Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Peoples R China

distributed arithmetic coding (DAC) is a practical realization of Slepian-Wolf coding, one of whose properties is Coset Cardinality Spectrum (CCS). The initial CCS is especially important because it has many applications. Up to now, the initial CCS is calculable only for some discrete rates, while in general cases, the time-consuming numerical algorithm is needed. Though a polynomial approximation of the initial CCS has been proposed recently, its complexity becomes very high as code rate decreases. Hence, this letter aims at finding simpler approximations for the initial CCS at low rates by proposing two methods: interpolation approximation and bell-shaped approximation. The effectiveness of both methods is illustrated by simulation results.

关键词： Interpolation Approximation algorithms Encoding Complexity theory arithmetic Symbols Probability density function Slepian-Wolf coding distributed arithmetic coding coset cardinality spectrum interpolation approximation bell-shaped approximation

来源：评论

学校读者我要写书评

暂无评论

Multi-Level distributed arithmetic coding with Nested Lattice Quantization

Multi-Level Distributed Arithmetic Coding with Nested Lattic...

引用

Data Compression Conference (DCC)

作者： Keshtkarjahromi, Yasaman Valipour, Mehrdad Lahouti, Farshad Univ Illinois Chicago IL 60607 USA Queens Univ Kingston ON Canada Univ Tehran Tehran Iran

ISBN: (纸本)9781479938827

In this paper, a scheme based on 1-D nested lattice quantization followed by multi-level distributed arithmetic coding (MLDAC) as the Slepian-Wolf (SW) code is proposed for the lossy source coding of continuous sources. This system can be employed in distributed video and image coding applications. The output of the quantizer is first converted to binary, and then the SW coding is applied on each bit plane. An efficient algorithm for joint decoding of bit planes at the decoder is proposed, which exploits the dependency of the bit planes with each other and the side-information available at the decoder. Also, a methodology for rate allocation among the bit planes is presented. The quantization parameters are designed to improve the end-to-end system performance based on its overall rate-distortion function taking into account both the distortions due to quantization and imperfect practical Slepian-Wolf coding. The simulation results demonstrate the effectiveness of the proposed MLDAC with the lattice quantization.

关键词： distributed arithmetic coding Nested Lattice Quantization and Wyner-Ziv Code

来源：评论

学校读者我要写书评

暂无评论

HMM Based distributed arithmetic coding and Its Application in Image coding

HMM Based Distributed Arithmetic Coding and Its Application ...

引用

5th International Conference on Machine Vision (ICMV) - Computer Vision, Image Analysis and Processing

作者： Dong, Wang Lin, Huang Northwest A&F Univ Coll Informat Engn Shaanxi Yang Ling 712100 Peoples R China

ISBN: (纸本)9780819495877

distributed source coding was proved to be suitable to correlated sources environments. This paper intends to explore a new way to improve distributed arithmetic coding and apply it in image coding. The proposed method models the correlation between sources as a Hidden Markov Model process. The decoder uses Viterbi algorithm to get a better error rate. Adjacent lines of the image are regarded as correlated sources in image coding process. Experiments that compress synthetic and real image data are carried on and the result shows that Hidden Markov Model-based distributed arithmetic coding can get better code rate and lower frame error rate.

关键词： distributed arithmetic coding Hidden Markov model Image coding

来源：评论

学校读者我要写书评

暂无评论

MODIFIED DEcoding METRIC OF distributed arithmetic coding

MODIFIED DECODING METRIC OF DISTRIBUTED ARITHMETIC CODING

引用

IEEE International Conference on Image Processing (ICIP)

作者： Yang, Yanchao Qi, Mingwei Zhou, Junwei Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163956

As an alternative implementation of Slepian-Wolf coding, distributed arithmetic coding is very competitive in short and medium block lengths. The existing distributed arithmetic coding decoder uses the maximum a posteriori metric and the M-algorithm to select the decoding sequence by considering the prior information. Since the prior probability distribution has been explored by the encoding process via the model stage and retained in the codeword, we propose a modified decoding metric ignoring the prior information. The reliability of the decoding paths is only determined by the correlation between the side information and the input source. Simulation results show that the modified metric can significantly reduce the decoding error.

关键词： Slepian-Wolf coding distributed arithmetic coding arithmetic coding distributed source coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：