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

Improved arithmetic coding algorithm

Journal of Shanghai University 2004年第4期8卷 455-457页

作者： Hai, Mei Zhang, Jian-Jun Ni, Xing-Fang Dept. of Math. Coll. of Sci. Shanghai Univ. Shanghai 200436 China Dept. of Electron. Eng. Coll. of Technol. Shanghai Jiaotong Univ. Shanghai 200030 China

arithmetic coding is the most powerful technique for statistical lossless encoding that has attracted much attention in recent years. In this paper, we presents a new implementation of bit-level arithmetic coding by use of integer additions and shifts. The new algorithm has less computation complexity and is more flexible to use, and thus is very suitable for software and hardware design. We also discuss the application of the algorithm to the data encryption.

关键词： arithmetic coding Data encryption

来源：评论

学校读者我要写书评

暂无评论

Comparison study of EMG signals compression by methods transform using vector quantization, SPIHT and arithmetic coding

引用

SPRINGERPLUS 2016年第1期5卷 1页

作者： Ntsama, Eloundou Pascal Colince, Welba Ele, Pierre Univ Ngaoundere Fac Sci Dept Phys POB 454 Ngaoundere Cameroon Univ Maroua Inst Mines & Petr Ind Dept Basic Sci Law & Humanities POB 46 Maroua Cameroon Univ Yaounde I Natl Adv Sch Engn Elect Engn & Telecommun Dept Yaounde Cameroon Univ Douala IUT POB 8698 Douala Cameroon

In this article, we make a comparative study for a new approach compression between discrete cosine transform (DCT) and discrete wavelet transform (DWT). We seek the transform proper to vector quantization to compress the EMG signals. To do this, we initially associated vector quantization and DCT, then vector quantization and DWT. The coding phase is made by the SPIHT coding (set partitioning in hierarchical trees coding) associated with the arithmetic coding. The method is demonstrated and evaluated on actual EMG data. Objective performance evaluations metrics are presented: compression factor, percentage root mean square difference and signal to noise ratio. The results show that method based on the DWT is more efficient than the method based on the DCT.

关键词： Compression EMG DWT DCT Vector quantization SPIHT arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

State-based dynamic multi-alphabet arithmetic coding for image compression

引用

The Journal of Photographic Science 2009年第1期57卷 30-36页

In this paper, a novel state-based dynamic multi-alphabet arithmetic coding algorithm which adapts efficiently to the locally occurring symbol statistics is presented. The proposed coding algorithm is applicable to sources such as raw images or transformed images that locally produce a smaller set of symbols from a large alphabet, or any other source characterized by very large alphabet size and highly skewed distributions. The performance of the proposed algorithm is compared with two standard entropy coding schemes, CA-2D-VLC and CABAC, that have recently appeared in the literature, in terms of compression ratio, peak signal-to-noise ratio and subjective quality. The simulation results obtained are encouraging, paving the way for further research and hardware implementation of this algorithm. It is found that the proposed algorithm achieves an increase in the compression ratio of about 45% over the compared standards for the similar peak signal-to-noise ratio and subjective quality.

关键词： IMAGE coding arithmetic coding LOSSLESS COMPRESSION H.264 AVS

来源：评论

学校读者我要写书评

暂无评论

AN arithmetic coding SCHEME FOR GRAY-SCALE IMAGES WITH MINIMUM DESCRIPTION LENGTH CRITERION

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 1995年第5期78卷 89-101页

作者： ZHANG, Q KOHNO, R IMAI, H YOKOHAMA NATL UNIV FAC ENGNYOKOHAMAKANAGAWA 240JAPAN UNIV TOKYO INST IND SCITOKYO 106JAPAN

In the arithmetic coding of the multilevel gray-scale image (128 levels) up to now, the fixed model for the gray-scale image is applied. This paper proposes a method to improve the compression ratio by introducing the minimum description length (MDL) into the encoder to describe more precisely the local property of the image and by adaptively selecting the probabilistic model. In the course of this development, a practical form of MDL criterion is presented to be adaptively applied to the encoding as an approximation to the MDL criterion proposed by Rissanen. A problem in the arithmetic coding of the multilevel gray-scale image using a probabilistic model with a large number of parameters is the deterioration of the compression ratio. To solve this problem, this paper proposes a convergence acceleration method for the average code length for the arithmetic encoding of the high-level gray-scale image. Then, based on the proposed acceleration method, the MDL criterion is introduced into the arithmetic coding of the multilevel gray-scale image. Finally, the effectiveness of the proposed coding method is demonstrated by computer simulation.

关键词： MDL CRITERION MULTILEVEL GRAY-SCALE IMAGE arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

An Original Domain based Acceleration Algorithm of Logarithmic Binary arithmetic coding

An Original Domain based Acceleration Algorithm of Logarithm...

引用

作者： Zhenyu Wang Kui Fan Ronggang Wang Hongbin Cao Bingjie Han Wen Gao Shenzhen Graduate School Peking University Institute of Digital Media Peking University

In the series of AVS coding standard, logarithmic domain based adaptive binary arithmetic coder(LBAC) is used with a high datacompression ratio and a hardware-efficient structure. However, the existing software implementation of LBAC is of high complexity, especially for the decoder. Based on the analysis of the mapping mechanism between the logarithmic domain and the original domain, this paper proposes an original domain based acceleration algorithm for LBAC(ODB-LBAC). This algorithm simplifies the existing decoding process of LBAC and is friendly for software implementation. Experimental results show that, ODB-LBAC achieves a speedup of 5.65% and 18.28% in a fully optimized AVS2 decoder, for random-access and all-intra configurations, respectively. At present, this algorithm has been adopted into the AVS3 reference software as the reference implementation of LBAC.

关键词： arithmetic coding LBAC AVS video decoding CABAC

来源：评论

学校读者我要写书评

暂无评论

Research on Practical Implementation of Binary arithmetic coding with Forbidden Symbol for Error Resilience

Research on Practical Implementation of Binary Arithmetic Co...

引用

2011 International Conference on Frontiers in Computer Education(ICFCE 2011)

作者： Wei Zhang Feng Cen Fanglai Zhu The Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Control Science & Engineering Tongji University

arithmetic coding is a widely applied compression tool with superior coding efficiency to other entropy coding methodsHowever, it suffers from the error resilience and complexityIn this paper, the integer implementation of binary arithmetic coding with forbidden symbol for error resilience is studiedcoding redundancies for employing different quantization coefficients in probability representation and cost effective backtracking distance in bits for maximum a posteriori(MAP) decoding are studied in depthWe observe that the optimal quantization coefficients are independent of forbidden symbol and the probabilities of source and the cost effective backtracking distance is related to the source entropy and the given forbidden symbol probabilitiesSuch observations are also demonstrated by extensive experiments.

关键词： arithmetic coding Forbidden symbol Error resilience MAP

来源：评论

学校读者我要写书评

暂无评论

An Improved Normalization for arithmetic coding

An Improved Normalization for Arithmetic Coding

引用

ICEMI'2005第七届国际电子测量与仪器学术会议

作者： Huang Jing Zhu Rihong Li Jianxin (School of Electronic Engineering and Photoelectric Technology, Nanjing University of Science &Technology, Nanjing 210094 China)

In the fast algorithm of arithmetic coding proposed by Jiang, the normalization is controlled by the width of the coding range and the output codes are in bits style. But the bit-stuffing technique to

关键词： Data compression arithmetic coding normalization carry propagation.

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL DEPENDENCY CONTEXT MODEL BASED arithmetic coding FOR DCT VIDEO COMPRESSION

HIERARCHICAL DEPENDENCY CONTEXT MODEL BASED ARITHMETIC CODIN...

引用

IEEE International Conference on Image Processing

作者： Min Gao Debin Zhao Qiang Wang Wen Gao Department of Computer Science and Technology Harbin Institute of Technology

ISBN: (纸本)9781479957521

This paper presents an arithmetic coding scheme for DCT coefficients in video compression, in which the number of non-zero coefficients, significant map and level information for a DCT block are used as coding elements. To exploit the statistical correlations, an hierarchical dependency context model (HDCM) is proposed, where the number of non-zero coefficients and scanned position are used to capture the magnitude varying tendency of DCT coefficients. Then a new binary arithmetic coding using HDCM (HDCMBAC) is proposed to code the coding elements. Experimental results demonstrate that HDCMBAC can achieve the similar coding performance as CABAC at low and high QPs. Meanwhile the context modeling and arithmetic decoding in HDCMBAC can be carried out in parallel, since the context dependency only exists among different parts of basic coding elements in HDCM.

关键词： arithmetic coding Context modeling Video compression DCT coefficients

来源：评论

学校读者我要写书评

暂无评论

OPTIMIZING THE SEARCH OF FINITE-STATE JOINT SOURCE-CHANNEL CODES BASED ON arithmetic coding

OPTIMIZING THE SEARCH OF FINITE-STATE JOINT SOURCE-CHANNEL C...

引用

European signal processing conference

作者： A. Diallo C. Weidmann M. Kieffer LSS - CNRS - SUPELEC - Univ. Paris-Sud 3 rue Joliot-Curie 91192 Gif-sur-Yvette France INTHFT Vienna University of Technology Gusshausstrasse 25/389 1040 Vienna Austria

ISBN: (纸本)9781617388767

Joint source-channel (JSC) coding is an important alternative to classic separate coding in wireless applications that require robustness without feedback or under stringent delay constraints. JSC schemes based on arithmetic coding can be implemented with finite-state encoders (FSE) generating finite-state codes (FSC). The performance of an FSC is primarily characterized by its free distance, which can be computed with efficient algorithms. This work shows how all FSEs corresponding to a set of initial parameters (source probabilities, arithmetic precision, design rate) can be ordered in a tree data structure. Since an exhaustive search of the code with the largest free distance is very difficult in most cases, a criterion for optimized exploration of the tree of FSEs is provided. Three methods for exploring the tree are proposed and compared with respect to the speed of finding a code with the largest free distance.

关键词： Codes arithmetic coding minimum free distance precision design tree data structures Feedback

来源：评论

学校读者我要写书评

暂无评论

MASSIVELY PARALLEL LOSSLESS COMPRESSION OF MEDICAL IMAGES USING LEAST-SQUARES PREDICTION AND arithmetic coding

MASSIVELY PARALLEL LOSSLESS COMPRESSION OF MEDICAL IMAGES US...

引用

IEEE International Conference on Image Processing

作者： Andreas Weinlich Johannes Rehm Peter Amon Andreas Hutter André Kaup Multimedia Communications and Signal Processing Universit?t Erlangen-Nürnberg Erlangen Germany Imaging and Computer Vision Siemens Corporate Technology Munich Germany

ISBN: (纸本)9781479923427

Medical imaging in hospitals requires fast and efficient image compression to support the clinical work flow and to save costs. Least-squares autoregressive pixel prediction methods combined with arithmetic coding constitutes the state of the art in lossless image compression. However, a high computational complexity of both prevents the application of respective CPU implementations in practice. We present a massively parallel compression system for medical volume images which runs on graphics cards. Image blocks are processed independently by separate processing threads. After pixel prediction with specialized border treatment, prediction errors are entropy coded with an adaptive binary arithmetic coder. Both steps are designed to match particular demands of the parallel hardware architecture. Comparisons with current image and video coders show efficiency gains of 3.3-13.6% while compression times can be reduced to a few seconds.

关键词： Nvidia CUDA GPGPU parallelization adaptive binary arithmetic coding parallel predictive coding 2-D least-squares autoregression computed tomography Medical imaging Workflow X-Ray Computed Tomography arithmetic Data compression Image compression images state of the art video coder lossless compression lossless image compression arithmetic coding Current Pick compression system graphic images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：