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

Conference on Satellite Data Compression, Communications, and Processing VI

作者： Wu, Jiaji Wang, Minli Fang, Yong Jeong, Jechang Jiao, Licheng Xidian Univ Sch Elect Engn Xian 710071 Peoples R China Hanyang Univ Dept Elect & Comp Engn Coll Engn Seoul 133791 South Korea Northwest A&F Univ Coll Informat Engn Yangling 712100 Peoples R China

ISBN: (纸本)9780819483065

Hyperspectral images are of very large data size and highly correlated in neighboring bands, therefore, it is necessary to realize the efficient compression performance on the condition of low encoding complexity. In this paper, we propose a method based on both partitioning embedded block and lossless adaptive-distributed arithmetic coding (LADAC). Combined with three-dimensional wavelet transform and SW-SPECK algorithm, LADAC is adopted according to the correlation between the adjacent bit-plane. Experimental results show that our proposed algorithm outperforms 3D-SPECK, furthermore, our method need not take the inter-band prediction or transform into account, so the complexity is small relatively.

关键词： Hyperspectral imagery Distributed source coding arithmetic coding Slepian-Wolf coding LDPC codes distributed arithmetic coding lossless adaptive-distributed arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

HILBERT SCANNING arithmetic coding FOR MULTISPECTRAL IMAGE COMPRESSION 14

HILBERT SCANNING ARITHMETIC CODING FOR MULTISPECTRAL IMAGE C...

引用

CONF ON APPLICATIONS OF DIGITAL IMAGE PROCESSING 14

作者： PEREZ, A KAMATA, S KAWAGUCHI, E Instituto Tecnologico y de Estudios Superiores de Monterrey (Mexico) Kyushu Institute of Technology (Japan)

ISBN: (纸本)0819406953

We consider the compression of multispectral images using Hilbert scanning and adaptive arithmetic coding. The Hilbert scan is a general technique for continuous scanning of multidimensional data. arithmetic coding has established itself as the superior method for lossless compression. The aim of this paper is to investigate the integration of the arithmetic coding methodology and a n-dimensional Hilbert scanning algorithm developed by Perez, Kamata and Kawaguchi.

关键词： arithmetic coding COMPRESSION HILBERT SCANNING MODELING MULTISPECTRAL IMAGE LANDSAT

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of secure arithmetic coding

Cryptanalysis of secure arithmetic coding

引用

33rd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Zhou, Jiantao Au, Oscar C. Wong, Peter H. Fan, Xiaopeng Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424414833

This work investigates the security issues of the recently proposed secure arithmetic coding (AC), which is an encryption scheme incorporating the interval splitting AC with a series of symbol and codeword permutations. We propose a chosen-ciphertext attack which is capable of recovering the key vectors for codeword permutations with complexity O(N), where N is the symbol sequence length. After getting the key vectors for codeword permutations, we can remove the codeword permutation module, and the resulting system has already been shown to be insecure in the original paper [5].

关键词： cryptanalysis arithmetic coding digital rights management

来源：评论

学校读者我要写书评

暂无评论

Encoding of multi-alphabet sources by binary arithmetic coding

Encoding of multi-alphabet sources by binary arithmetic codi...

引用

Meeting on Visual Communications and Image Processing

作者： Guo, ML Oka, T Kato, S Kajiwara, H Kawamura, N Utsunomiya Univ Grad Sch Engn Utsunomiya Tochigi 3218585 Japan

ISBN: (纸本)0819431249

In case of encoding a multi-alphabet source, the multi-alphabet symbol sequence can be encoded directly by a multi-alphabet arithmetic encoder, or the sequence can be first converted into several binary sequences and then each binary sequence is encoded by binary arithmetic encoder, such as the L-R arithmetic coder. arithmetic coding, however, requires arithmetic operations for each symbol and is computationally heavy. In this paper, a binary representation method using Huffman tree is introduced to reduce the number of arithmetic operations, and a new probability approximation for L-R arithmetic coding is further proposed to improve the coding efficiency when the probability of LPS(Least Probable Symbol) is near 0.5. Simulation results show that our proposed scheme has high coding efficiency and can reduce the number of coding symbols.

关键词： source coding arithmetic coding binary representation

来源：评论

学校读者我要写书评

暂无评论

A Write-friendly arithmetic coding Scheme for Achieving Energy-Efficient Non-Volatile Memory Systems 21

A Write-friendly Arithmetic Coding Scheme for Achieving Ener...

引用

26th Asia and South Pacific Design Automation Conference (ASP-DAC)

作者： Chen, Yi-Shen Wu, Chun-Feng Chang, Yuan-Hao Kuo, Tei-Wei Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei Taiwan Acad Sinica Inst Informat Sci Taipei Taiwan City Univ Hong Kong Coll Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781450379991

In the era of the Internet of Things (IoT), wearable IoT devices become popular and closely related to our life. Most of these devices are based on the embedded systems that have to operate on limited energy resources, such as batteries or energy harvesters. Therefore, energy efficiency is one of the critical issues for these devices. To relieve the energy consumption by reducing the total accesses on memory and storage layers, the technologies of storage-class memory (SCM) and data compression techniques are applied to eliminate the data movements and squeeze the data size, respectively. However, the information gap between them hinders the cooperation among the two techniques for achieving further optimizations on minimizing energy consumption. This work proposes a write-friendly arithmetic coding with joint managing both techniques to achieve energy-efficient non-volatile memory (NVM) systems. In particular, the concept of "ignorable bits" is introduced to further skip the write operations while storing the compressed data into SCM devices. The proposed design was evaluated by a series of intensive experiments, and the results are encouraging.

关键词： Internet of Things non-volatile memory data compression arithmetic coding energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Predictive data compression using adaptive arithmetic coding

Predictive data compression using adaptive arithmetic coding

引用

作者： Iombo, Claudio Jose Louisiana State University

学位级别：硕士

The commonly used data compression techniques do not necessarily provide maximal compression and neither do they define the most efficient framework for transmission of data. In this thesis we investigate variants of the standard compression algorithms that use the strategy of partitioning of the data to be compressed. Doing so not only increases the compression ratio in many instances, it also reduces the maximum data block size for transmission. The partitioning of the data is made using a Markov model to predict if doing so would result in increased compression ratio. Experiments have been performed on text files comparing the new scheme to adaptive Huffman and arithmetic coding methods. The adaptive Huffman method has been implemented in a new way by combining the FGK method with Vitter's implicit ordering of nodes.

关键词： markov models information theory arithmetic coding huffman coding data compression

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding of speech and audio spectra using tcx based on linear predictive spectral envelopes

Arithmetic coding of speech and audio spectra using tcx base...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： T. Backstrom C. R. Helmrich Int. Audio Labs. Erlangen1 Friedrich-Alexander Univ. (FAU) Erlangen Germany

ISBN: (纸本)9781467369985

Unified speech and audio codecs often use a frequency domain coding technique of the transform coded excitation (TCX) type. It is based on modeling the speech source with a linear predictor, spectral weighting by a perceptual model and entropy coding of the frequency components. While previous approaches have used neighbouring frequency components to form a probability model for the entropy coder of spectral components, we propose to use the magnitude of the linear predictor to estimate the variance of spectral components. Since the linear predictor is transmitted in any case, this method does not require any additional side info. Subjective measurements show that the proposed methods give a statistically significant improvement in perceptual quality when the bit-rate is held constant. Consequently, the proposed method has been adopted to the 3GPP Enhanced Voice Services speech coding standard.

关键词： arithmetic coding frequency domain coding speech and audio coding arithmetic coding linear predictor speech coding Spectral composition Speech linear prediction Audio Entropy coding Bit rate 3GPP

来源：评论

学校读者我要写书评

暂无评论

A novel approach based on wavelet analysis and arithmetic coding for automated detection and diagnosis of epileptic seizure in EEG signals using machine learning techniques

引用

BIOMEDICAL SIGNAL PROCESSING AND CONTROL 2020年第0期56卷 101707-000页

作者： Amin, Hafeez Ullah Yusoff, Mohd Zuki Ahmad, Rana Fayyaz Univ Teknol Petronas CISIR Dept Elect & Elect Engn Bandar Seri Iskandar 32610 Perak Malaysia

Epilepsy, a common neurological disorder, is generally detected by electroencephalogram (EEG) signals. Visual inspection and interpretation of EEGs is a slow, time consuming process that is vulnerable to error and subjective variability. Consequently, several efforts to develop automatic epileptic seizure detection and classification methods have been made. The present study proposes a novel computer aided diagnostic technique (CAD) based on the discrete wavelet transform (DWT) and arithmetic coding to differentiate epileptic seizure signals from normal (seizure-free) signals. The proposed CAD technique comprises three steps. The first step decomposes EEG signals into approximations and detail coefficients using DWT while discarding non-significant coefficients in view of threshold criteria;thus, limiting the number of significant wavelet coefficients. The second step converts significant wavelet coefficients to bit streams using arithmetic coding to compute the compression ratio. In the final step, the compression feature set is standardized, whereupon machine-learning classifiers detect seizure activity from seizure-free signals. We employed the widely used benchmark database from Bonn University to compare and validate the technique with results from prior approaches. The proposed method achieved a perfect classification performance (100% accuracy) for the detection of epileptic seizure activity from EEG data, using both linear and non-liner machine-learning classifiers. This CAD technique can thus be considered robust with an extraordinary detection capability that discriminates epileptic seizure activity from seizure-free and normal EEG activity with simple linear classifiers. The method has the potential for efficient application as an adjunct for the clinical diagnosis of epilepsy. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Electroencephalography (EEG) Epileptic seizure Discrete wavelet transform (DWT) arithmetic coding Machine learning classifiers Computer-aided diagnostic

来源：评论

学校读者我要写书评

暂无评论

Proposal of a fast multialphabet dynamic arithmetic coding

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 2000年第11期83卷 66-75页

作者： Osawa, H Suzuki, K Kato, S Yasuda, Y Canon Inc CX Project Kawasaki Kanagawa 2118501 Japan Utsunomiya Univ Fac Engn Utsunomiya Tochigi 3210912 Japan Waseda Univ Grad Sch Sci & Engn Tokyo 1690072 Japan

Image coding is discussed in two phases;one is transformation of image signals using a coding model, and the other is entropy coding which assigns a code to a transformed sequence. A well-known example of the latter is arithmetic coding. Because arithmetic coding makes dynamic adaptation rather easy, it is used in efficient entropy coding of signals, such as image signals, whose statistical characteristics vary locally. Though adaptation is an effective measure to achieve efficient coding, it requires longer processing time and larger hardware size. The authors have proposed multialphabet arithmetic coding with a 1/2(n) rate approximation, whose algorithm is simple. This arithmetic coding can be performed with an extremely small amount of multiplication, and it can be extended to adaptation simply by recalculation of cumulative approximate probability. In this article, we will propose a method that optimizes update timing in adaptation, and show that we obtained satisfactory results in efficiency and coding speed. (C) 2000 Scripta Technica.

关键词： predictive coding arithmetic coding Huffman coding adaptive coding

来源：评论

学校读者我要写书评

暂无评论

p-Suffix sorting as arithmetic coding

引用

JOURNAL OF DISCRETE ALGORITHMS 2012年 16卷 151-169页

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

The challenge of direct parameterized suffix sorting (p-suffix sorting) for a parameterized string (p-string), say T of length-n, is the dynamic nature of the n parameterized suffixes (p-suffixes) of T. 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 nonbinary parameter alphabets, which assumes that, in practice, all codes are within the range of an integral data type. 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. The arithmetic coding approach is further extended to handle p-strings in the worst case. This algorithm is the first direct p-suffix sorting approach in theory to execute in o(n(2)) time in the worst case, which improves on the best known theoretical result on this problem that sorts p-suffixes based on p-suffix classifications in O(n(2)) time. We show that, based on the algorithmic parameters and the input data, our algorithm does indeed execute in linear time in various cases, which is confirmed with experimental results. (C) 2012 Elsevier B. V. All rights reserved.

关键词： Parameterized suffix array Parameterized suffix sorting arithmetic coding Fingerprints p-string p-match

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：