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

Perturbation meets key-based interval splitting arithmetic coding: security enhancement and chaos generalization

SECURITY AND COMMUNICATION NETWORKS 2016年第1期9卷 43-53页

作者： Zhang, Yushu Xiao, Di Wong, Kwok-Wo Zhou, Jiantao Bai, Sen Su, Moting Southwest Univ Sch Elect & Informat Engn Chongqing 400715 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China Univ Macau Fac Sci & Technol Dept Comp & Informat Sci Taipa Macau Peoples R China Chongqing Commun Inst Dept Informat Engn Chongqing 400035 Peoples R China Chongqing Univ Sch Econ & Business Adm Chongqing 400044 Peoples R China

Key-based interval splitting arithmetic coding (KAC) possesses both encryption and compression capabilities. However, it possesses vulnerability to chosen-plaintext attack because the attacker can explore the relationship between the key and the codeword to deduce the secret key. In order to resist this attack, we propose to introduce perturbation into KAC. The perturbation-based KAC not only avoids the flaw of KAC that the splitting keys are usually located at the endpoint of certain codeword or at the border of two codewords but also removes the restriction that the keys are only allowed in certain sub-intervals, which result in great convenience to the key scheduler. In addition, based on generalized arithmetic coding using Generalized Luroth Series, we study the phase-space splitting of a chaotic map for generalized KAC and suggest the generalized perturbation-based KAC. This leads to the design of a joint compression and encryption scheme with more powerful cryptographic features. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： arithmetic coding perturbation joint compression and encryption chaotic map

来源：评论

学校读者我要写书评

暂无评论

Compaction of ordered dithered images with arithmetic coding

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2001年第5期10卷 797-802页

作者： Lin, YY Wang, YJ Fan, TH Natl Cent Univ Dept Elect Engn Chungli 32054 Taiwan Natl Cent Univ Inst Stat Chungli 32054 Taiwan

Ordered dither is considered to be a simple and effective method among all halftoning techniques. In this paper, compaction of ordered dithered images using arithmetic coding is studied. A preprocessor referred to as pixel interleaving (i.e., grouping pixels with similar dithering thresholds) is employed in such a way that dithered images can be efficiently coded with the JBIG1 code and high compressibility can be achieved. Experimental results reveal that the four-pixel interleaving achieves the best compression performance.

关键词： arithmetic coding halftoning Joint Bilevel Group (JBIG) ordered dither

来源：评论

学校读者我要写书评

暂无评论

A greedy renormalization method for arithmetic coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2007年第8期55卷 1494-1503页

作者： Jia, Yunwei Yang, En-hui He, Da-ke Chan, Steven Adv Micro Devices Inc Markham ON L3T 7X6 Canada Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA SlipStream Data Inc Waterloo ON N2L 5Z5 Canada

A typical arithmetic coder consists of three steps: range calculation, renormalization, and probability model updating. In this paper, we propose and analyze from an information theoretic point of view a greedy renormalization method, which has two components: greedy thresholding and greedy outputting. The method significantly reduces the computational complexity of the renormalization step of arithmetic coding by 1) using the greedy thresholding to minimize the number of renormalizations required to encode a sequence and 2) using the greedy outputting to minimize the number of operations within each renormalization. The method is particularly suitable for binary arithmetic coding (BAC). Two BAC algorithms based on this method are presented. The first algorithm replaces the renormalization method in the TOIS BAC [21 with the greedy renormalization method, and keeps other parts of the TOIS BAC unchanged. For binary independent and identically distributed (i.i.d.) sources with the probability of the less probable symbol ranging from 0.01-0.45, over 20% gain in speed (on average), and less than 1% loss in compression rate (in the worst case) are observed in the experiments. The second algorithm combines the greedy renormalization method with the QM-Coder. On an average, 30% gain in speed and 3% gain in compression rate are observed in the experiments.

关键词： arithmetic coding computational complexity data compression source coding

来源：评论

学校读者我要写书评

暂无评论

An improved lossless image compression based arithmetic coding using mixture of non-parametric distributions

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第23期74卷 10605-10619页

作者： Masmoudi, Atef Puech, William Masmoudi, Afif Univ Sfax Sfax Preparatory Engn Inst Sfax Tunisia Univ Montpellier 2 LIRMM UMR CNRS 5506 F-34392 Montpellier 05 France Univ Sfax Fac Sci Sfax Lab Stat & Probabil Sfax Tunisia

In this paper, we propose a new approach for a block-based lossless image compression using finite mixture models and adaptive arithmetic coding. Conventional arithmetic encoders encode and decode images sample-by-sample in raster scan order. In addition, conventional arithmetic coding models provide the probability distribution for whole source symbols to be compressed or transmitted, including static and adaptive models. However, in the proposed scheme, an image is divided into non-overlapping blocks and then each block is encoded separately by using arithmetic coding. The proposed model provides a probability distribution for each block which is modeled by a mixture of non-parametric distributions by exploiting the high correlation between neighboring blocks. The Expectation-Maximization algorithm is used to find the maximum likelihood mixture parameters in order to maximize the arithmetic coding compression efficiency. The results of comparative experiments show that we provide significant improvements over the state-of-the-art lossless image compression standards and algorithms. In addition, experimental results show that the proposed compression algorithm beats JPEG-LS by 9.7 % when switching between pixel and prediction error domains.

关键词： arithmetic coding Lossless compression Image compression Finite mixture model Expectation-maximization algorithm Kullback-Leibler distance

来源：评论

学校读者我要写书评

暂无评论

Multimedia selective encryption by means of randomized arithmetic coding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2006年第5期8卷 905-917页

作者： Grangetto, Marco Magli, Enrico Olmo, Gabriella CERCOM Dipartimento Elettr Politecn Torino I-10129 Turin Italy

We propose a novel multimedia security framework based on a modification of the arithmetic coder, which is used by most international image and video coding standards as entropy coding stage. In particular, we introduce a randomized arithmetic coding paradigm, which achieves encryption by inserting some randomization in the arithmetic coding procedure;notably, and unlike previous works on encryption by arithmetic coding, this is done at no expense in terms of coding efficiency. The proposed technique can be applied to any multimedia coder employing arithmetic coding;in this paper we describe an implementation tailored to the JPEG 2000 standard. The proposed approach turns out to be robust towards attempts to estimating the image or discovering the key, and allows very flexible protection procedures at the code-block level, allowing to perform total and selective encryption, as well as conditional access.

关键词： arithmetic coding conditional access JPEG 2000 selective encryption

来源：评论

学校读者我要写书评

暂无评论

Error detection in arithmetic coding with artificial markers

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2011年第1期62卷 359-366页

作者： Wong, Kwok-Wo Lin, Qiuzhen Chen, Jianyong City Univ Hong Kong Dept Elect Engn Kowloon Tong Hong Kong Peoples R China Shenzhen Univ Dept Comp Sci & Software Engn Shenzhen Peoples R China

Error detection in arithmetic code is usually achieved by inserting markers in the source sequence during encoding. Transmission errors can then be detected in the decoding process if the inserted markers do not appear at the expected positions. Unlike the existing approaches in which the marker symbol is selected from the set of source symbols, we propose that the marker be created artificially so as not to affect the original distribution of the source symbols. Our scheme is proved to possess a better compression ratio than existing marker approaches at the same error misdetection probability. The relationship between codeword length expansion and error misdetection probability within a coded block is well formulated, which makes it easy to adapt to channels with different bit error rates. Simulation results show that, for adaptive arithmetic coding implemented using finite-precision computation, the distribution of error detection delay has a peak at a value slightly larger than the length of the decoding register. With a sufficiently long register, our approach can detect most error patterns in long source sequences at a high probability. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Data compression arithmetic coding Error detection Artificial marker

来源：评论

学校读者我要写书评

暂无评论

Distributed video coding using interval overlapped arithmetic coding

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2019年 76卷 118-124页

作者： Zhou, Junwei Fu, Yincheng Yang, Yanchao Ho, Anthony T. S. Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China Univ Surrey Dept Comp Sci Guildford Surrey England

Distributed video coding (DVC) is a flexible and novel video coding mode that is different from traditional video compression methods, which can shift the complex task such as motion estimation from encoder to decoder. Nowadays, most of the DVC architectures adopt channel coding such as low-density parity-check codes. It is found that arithmetic coding can be also extended to compress correlated sources and even has better performance than the channel coding for short to medium block length sources. Therefore, we propose a DVC scheme using interval overlapped arithmetic coding that is distributed arithmetic coding (DAC) without feedback channel, where the Key frames are compressed using traditional video coder while the Wyner-Ziv frames are compressed using DAC. We compare the rate-distortion performance of the proposed scheme with the state-of-the-arts, and the experimental results indicate that the proposed scheme is competitive. The source code for this scheme is available in GitHub.

关键词： Distributed video coding Distributed arithmetic coding Video coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Upgraded Petri net model and analysis of adaptive and static arithmetic coding

引用

MATHEMATICAL AND COMPUTER MODELLING 2013年第7-8期58卷 1548-1562页

作者： Strbac, Perica Milovanovic, Gradimir V. Megatrend Univ Fac Comp Sci Novi Beograd 11070 Serbia Serbian Acad Arts & Sci Math Inst Beograd 11001 Serbia

In this paper, we analyze several adaptive and static data models of arithmetic compression. These models are represented by using Upgraded Petri net as our original class of the Petri nets. After the iterative processes of modeling, simulation and analysis, the models are transformed into an application. The models refer to one-pass and two-pass arithmetic coding where a set of symbols refers to bytes or nibbles. The frequency of a symbol is represented as an unsigned 32-bit integer. Original software for modeling and simulations of Upgraded Petri net, PeM (Petri Net Manager) is developed and used for all models described in this paper. All models are observed in the experiments by using a created application over a standard set of files. Experimental results are presented and compared. (c) 2013 Elsevier Ltd. All rights reserved.

关键词： arithmetic coding Upgraded Petri nets Data compression Source coding

来源：评论

学校读者我要写书评

暂无评论

Reversible arithmetic coding for quantum data compression

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第3期46卷 1104-1116页

作者： Chuang, IL Modha, DS IBM Corp Almaden Res Ctr San Jose CA 95120 USA

We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with high probability the block quantum state onto the typical subspace spanned by the leading eigenstates of its density matrix. We propose a fixed-rate quantum Shannon-Fano code to compress the projected block quantum state using a per-symbol code rate that is slightly higher than the von Neumann entropy limit. Finally, we propose quantum arithmetic codes to efficiently implement quantum Shannon-Fano codes. Our arithmetic encoder and decoder have a cubic circuit and a cubic computational complexity in the block size. Both the encoder and decoder are quantum-mechanical inverses of each other, and constitute an elegant example of reversible quantum computation.

关键词： arithmetic coding noiseless coding quantum communication quantum computation quantum information theory quantum measurement reversible computation Schumacher coding

来源：评论

学校读者我要写书评

暂无评论

On the security of binary arithmetic coding based on interval shrinking

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2016年第8期75卷 4245-4258页

作者： Xiang, Tao Sun, Jianglin Fu, Xinwen Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Univ Massachusetts Lowell Dept Comp Sci Lowell MA 01854 USA

arithmetic coding (AC) is often chosen for joint compression and encryption. In this paper, we conduct a careful analysis of secure binary AC schemes based on interval shrinking regarding its security. We first give theoretical conditions for our attacks, then under these conditions we are able to recover the plaintext using traditional AC decoder without knowing any shrinking information. The attacks are feasible to uni-shrinking and symmetric bi-shrinking in different AC models. Extensive simulations are carried out and experimental results have validated our theoretical analysis. Effective remedy is also given in the end.

关键词： arithmetic coding Joint compression and encryption Cryptanalysis Interval shrinking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：