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

22nd International Workshop on Combinatorial Algorithms

作者： Beal, Richard Adjeroh, Donald W Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV 26506 USA

ISBN: (纸本)9783642250101

The challenge of direct parameterized suffix sorting (p-suffix sorting) for a parameterized string (p-string) is the dynamic nature of parameterized suffixes (p-suffixes). In this work, we propose transformative approaches to direct p-suffix sorting by generating and sorting lexicographically numeric fingerprints and arithmetic codes that correspond to individual p-suffixes. Our algorithm to p-suffix sort via fingerprints is the first theoretical linear time algorithm for p-suffix sorting for non-binary parameter alphabets, which assumes that each code is represented by a practical integer. We eliminate the key problems of fingerprints by introducing an algorithm that exploits the ordering of arithmetic codes to sort p-suffixes in linear time on average.

关键词： parameterized suffix array parameterized suffix sorting arithmetic coding fingerprints p-string p-match

来源：评论

学校读者我要写书评

暂无评论

Text Data Compression for Mobile Phone Using Burrows-Wheeler Transform, Move-To-Front Code and arithmetic coding 3

Text Data Compression for Mobile Phone Using Burrows-Wheeler...

引用

3rd International Conference on Information and Communication Technology ICoICT

作者： Darwiyanto, Eko Pratama, Heru Anugrah Septiana, Gia Telkom Univ Sch Comp Bandung Indonesia

ISBN: (纸本)9781479977529

Text files are still dominant to be used in many storage devices, including mobile storage device. With fixed and small memory capacity of mobile phone, text compression is needed for the optimation of memory usage. Compression is the process of transforming data to code sets functioned to reduce the usage of memory wether or not reducing data quality and accelerating data transmission time. Compression can be lossless or lossy. In lossless compression, original text can be rearranged from compressed data. Combination of algorithms Burrows-Wheeler Transform, Move-To-Front Code and arithmetic coding can be used in lossless compression. There are many Quran applications for mobile phone, but rarely Hadits applications. Hadits is information about Prophet Muhammad ( pbuh) tradition. There are six most referenced Hadits collections. One of them is Sunan Ibnu Majah. It has 32 chapters. This research remains the compressing those text file using four schemes combination of algorithm: ( 1) arithmetic coding alone, ( 2) Move-To-Front Code and arithmetic coding, ( 3) Burrows Wheeler-Transform and arithmetic coding ( without Move-To-Front), ( 4) Burrows Wheeler-Transform, Move-To-Front Code and arithmetic coding. Several chapter from Sunan Ibnu Majah that vary in filesize have been selected to be compressed. Blocksize 1024, 2048, 4096 and 8192 byte will be used while using Move-To-Front Code algorithm. The best result from each schemes respectively are 58.9%, 36.30%, 59.01% and 32.62%. Using combination Burrows-Wheeler, Move-To-Front Code and arithmetic coding with the length of block 8192 bytes can achieve the best compression ratio 32.62%.

关键词： Mobile phone text compression Sunan Ibnu Majah Bahasa Translation Burrows-Wheeler Transform Move-To-Front Code arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Image transmission using arithmetic coding based continuous error detection.

Image transmission using arithmetic coding based continuous ...

引用

Data Compression Conference

作者： Kozintsev, I Chou, J Ramchandran, K Univ Illinois ECE Dept Chicago IL 60680 USA

ISBN: (纸本)0818684062

Block Cyclic Redundancy Check (CRC) codes represent a popular and powerful class of error detection techniques in modern data communication systems. Though efficient, CRC's can detect errors only after an entire block of data has been received and processed. In this work, we propose a new "continuous" error detection scheme using arithmetic coding that provides a novel tradeoff between the amount of added redundancy and the amount of time needed to detect an error once it occurs. We demonstrate how the new error detection framework improves the overall performance of transmission systems, and show how sizeable performance gains can be attained. We focus on two popular scenarios: (i) Automatic Repeat ReQuest (ARQ) based transmission;and (ii) Forward Error Correction frameworks based on (serially) concatenated coding systems involving an inner error-correction code and an outer error-detection code.

关键词： Error detection Image communication systems arithmetic coding DATA TRANSMISSION SYSTEMS Transmission systems coding systems cyclic redundancy check codes

来源：评论

学校读者我要写书评

暂无评论

A New Secret Image Sharing with arithmetic coding

A New Secret Image Sharing with Arithmetic Coding

引用

IEEE International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)

作者： Das, Sujit Kumar Dhara, Bibhas Chandra Jadavpur Univ Dept Informat Technol Kolkata 700032 W Bengal India

ISBN: (纸本)9781467367356

In this paper, we have proposed a new (t, n) secret image sharing scheme. In the proposed method the secret image is pre-processed block wise so that image becomes more suitable for arithmetic coding. The pre-processed information along with compressed bit stream, given by arithmetic coding, are used in secret sharing process. Finally, the generated shares are embedded into the cover images and for data hiding purpose we have adopted LSB based steganography method. This experiment ensures that cover image with same size as secret image is sufficient. Also, the quality of the stego images is more than 43dB which is quite satisfiable.

关键词： secret sharing arithmetic coding secret image sharing LSB Steganography

来源：评论

学校读者我要写书评

暂无评论

Efficient Bernoulli Probability Distribution Estimation for arithmetic coding 9

Efficient Bernoulli Probability Distribution Estimation for ...

引用

9th Mediterranean Conference on Embedded Computing (MECO)

作者： Ceperkovic, Vladimir Prokin, Milan Prokin, Dragana Univ Belgrade Sch Elect Engn Belgrade Serbia Sch Elect & Comp Engn Appl Studies Belgrade Serbia

ISBN: (纸本)9781728169491

State-of-the-art arithmetic coding utilizes finite state machines to select symbol probability estimates from the predefined finite set, resulting in inherently limited precision and increased code length. This paper presents novel method for Bernoulli probability distribution estimation, based on low pass filtering with varying dominant pole. This solution uses integer-only arithmetic, without multiplication or division operations, thus providing significant reduction in required resources of IoT devices.

关键词： data compression probability estimation arithmetic coding varying dominant pole filter

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding with dual symbol sets and its performance analysis

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1999年第12期8卷 1667-1676页

作者： Zhu, B Yang, EH Tewfik, AH Cognicity Inc Edina MN 55439 USA Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Univ Minnesota Dept Elect Engn Minneapolis MN 55455 USA

In this paper, we propose a novel adaptive arithmetic coding method that uses dual symbol sets: A primary symbol set that contains all the symbols that are likely to occur in the near future and a secondary symbol set that contains all other symbols. The simplest implementation of our method assumes that symbols that have appeared in the recent past are highly likely to appear in the near future. It therefore fills the primary set with symbols that have occurred in the recent past. Symbols move dynamically between the two symbol sets to adapt to the local statistics of the symbol source. The proposed method works well for sources, such as images, that are characterized by large alphabets and alphabet distributions that are skewed and highly nonstationary, We analyze the performance of the proposed method and compare it to other arithmetic coding methods, both theoretically and experimentally, We show experimentally that in certain contexts, e.g,, with a wavelet-based image coding scheme that has recently appeared in the literature, the compression performance of the proposed method is better than that of the conventional arithmetic coding method and the zero-frequency escape arithmetic coding method.

关键词： arithmetic coding data compression entropy coding image compression JPEG wavelet

来源：评论

学校读者我要写书评

暂无评论

Neural Network-Based arithmetic coding of Intra Prediction Modes in HEVC

Neural Network-Based Arithmetic Coding of Intra Prediction M...

引用

IEEE Visual Communications and Image Processing (VCIP)

作者： Song, Rui Liu, Dong Li, Houqiang Wu, Feng Univ Sci & Technol China CAS Key Lab Technol Geospatial Informat Proc & Ap Hefei 230027 Anhui Peoples R China

ISBN: (纸本)9781538604625

In both H.264 and HEVC, context-adaptive binary arithmetic coding (CABAC) is adopted as the entropy coding method. CABAC relies on manually designed binarization processes as well as handcrafted context models, which may restrict the compression efficiency. In this paper, we propose an arithmetic coding strategy by training neural networks, and make preliminary studies on coding of the intra prediction modes in HEVC. Instead of binarization, we propose to directly estimate the probability distribution of the 35 intra prediction modes with the adoption of a multi-level arithmetic codec. Instead of handcrafted context models, we utilize convolutional neural network (CNN) to perform the probability estimation. Simulation results show that our proposed arithmetic coding leads to as high as 9.9% bits saving compared with CABAC.

关键词： arithmetic coding Context-adaptive binary arithmetic coding Convolutional neural network HEVC Intra prediction mode

来源：评论

学校读者我要写书评

暂无评论

Does an arithmetic coding followed by run-length coding enhance the compression ratio?

引用

Research Journal of Applied Sciences, Engineering and Technology 2015年第7期10卷 736-741页

作者： Otair, Mohammed Computer Information Systems Amman Arab University Amman Jordan

Compression is a technique to minimize the quantity of image without excessively decreasing the quality of the image. Then, the translating of compressed image is much more efficient and rapidly than original image. arithmetic and Huffman coding are mostly used techniques in the entropy coding. This study tries to prove that RLC may be added after arithmetic coding as an extra processing step which may therefore be coded efficiently without any further degradation of the image quality. So, the main purpose of this study is to answer the following question "Which entropy coding, arithmetic with RLC or Huffman with RLC, is more suitable from the compression ratio perspective?" Finally, experimental results show that an arithmetic followed by RLC coding yields better compression performance than Huffman with RLC coding. © Maxwell Scientific Organization, 2015.

关键词： arithmetic coding arithmetic vs. Huffman Entropy coding Image compression Run-length coding

来源：评论

学校读者我要写书评

暂无评论

coding Pulse Sequences Using a Combination of Factorial Pulse coding and arithmetic coding

Coding Pulse Sequences Using a Combination of Factorial Puls...

引用

International Conference on Signal Processing and Communications

作者： Mittal, Udar Ramabadran, Tenkasi V. Ashley, James P. Motorola Inc Mobile Devices Business Bangalore 560093 Karnataka India Motorola Inc Mobile Devices Business Libertyville IL 60048 USA Motorola Inc Mobil Devices Business Schaumburg IL 60196 USA

ISBN: (纸本)9781424471379

A Factorial Pulse coding approach using combinatorial functions for coding of pulse sequences is presented. An arithmetic coding approach for coding of pulse sequences is also described. Factorial pulse coding and arithmetic coding are compared. A method of combining the two approaches is proposed. The proposed combining method works by extending the pulse sequence by one bit whose probability is found from the arithmetic coding bounds.

关键词： arithmetic codes arithmetic coding coding pulse sequences combinatorial functions factorial pulse coding

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL arithmetic coding OF DISPLACEMENTS FOR DYNAMIC MESH COMPRESSION 30

HIERARCHICAL ARITHMETIC CODING OF DISPLACEMENTS FOR DYNAMIC ...

引用

30th IEEE International Conference on Image Processing (ICIP)

作者： Nishimura, Hitoshi Kato, Haruhisa Kawamura, Kei KDDI Res Inc Fujimino Japan

ISBN: (纸本)9781728198354

Dynamic meshes reasonably represent time-varying 3D objects, but compression is required due to the large amount of data. One compression framework decomposes a dynamic mesh into a base mesh and displacements by using decimation and subdivision. The displacements are converted to coefficients by wavelet transforms, quantized, and compressed by video codec, which is well disseminated. However, the abundance of tools in video codec is too complex for uncorrelated displacements. In this paper, we propose hierarchical arithmetic coding, dividing the coefficient levels into blocks and smaller subblocks. When all levels are zero in a block/subblock, a flag is coded instead of the levels. The experimental results show that the coding complexity was significantly reduced while the coding efficiency was maintained.

关键词： dynamic mesh compression displacements arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：