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

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

来源：评论

学校读者我要写书评

暂无评论

Context-Based arithmetic coding Scheme for Parametric Stereo in Enhanced aacPlus

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2014年第6期30卷 2019-2032页

作者： Pang, Hee-Suk Lim, Jun-Seok Lee, Seokjin Sejong Univ Dept Elect Engn Seoul 143747 South Korea Kyonggi Univ Dept Elect Engn Suwon 443760 South Korea

Enhanced aacPlus is an audio codec which is composed of advanced audio coding (AAC), spectral band replication (SBR), and parametric stereo (PS) for efficient audio coding at low bit rates. We propose a new coding scheme for lossless bit rate reduction of PS in enhanced aacPlus. We first determine the optimal contexts for context-based coding of quantized stereo parameter indexes in PS. Then we propose a coding scheme which is based on context-based coding using the determined optimal contexts in conjunction with arithmetic coding. The proposed scheme has normal and memory-reduced versions, both of which are shown to guarantee significant and consistent lossless bit rate reduction of PS. The saved bits by the proposed scheme can be used for the other modules of enhanced aacPlus, AAC and SBR.

关键词： enhanced aacPlus parametric stereo lossless bit rate reduction context-based coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

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年 56卷

作者： 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

来源：评论

学校读者我要写书评

暂无评论

A pipeline chip for Quasi arithmetic coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2001年第4期E84A卷 1034-1041页

作者： Wiseman, Y Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel Jerusalem Coll Technol Dept Comp Engn IL-91160 Jerusalem Israel

A combination of a software and a systolic hardware implementation for the Quasi arithmetic compression algorithm is presented. The hardware is implemented as a pipeline hardware implementation. The implementation doesn't change the the algorithm. It just split it into two parts. The combination of parallel software and pipeline hardware can give very fast compression without decline of tile compression efficiency.

关键词： pipeline structure compression arithmetic coding hardware-software combination

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep Lossless Compression Algorithm Based on arithmetic coding for Power Data

引用

SENSORS 2022年第14期22卷 5331页

作者： Ma, Zhoujun Zhu, Hong He, Zhuohao Lu, Yue Song, Fuyuan State Grid Jiangsu Elect Power Co Ltd Nanjing Power Supply Branch Nanjing 210019 Peoples R China Hohai Univ Coll Energy & Elect Engn Nanjing 210098 Peoples R China Nanjing Univ Informat Sci & Technol Minist Educ Engn Res Ctr Digital Forens Nanjing 210044 Peoples R China

Classical lossless compression algorithm highly relies on artificially designed encoding and quantification strategies for general purposes. With the rapid development of deep learning, data-driven methods based on the neural network can learn features and show better performance on specific data domains. We propose an efficient deep lossless compression algorithm, which uses arithmetic coding to quantify the network output. This scheme compares the training effects of Bi-directional Long Short-Term Memory (Bi-LSTM) and Transformers on minute-level power data that are not sparse in the time-frequency domain. The model can automatically extract features and adapt to the quantification of the probability distribution. The results of minute-level power data show that the average compression ratio (CR) is 4.06, which has a higher compression ratio than the classical entropy coding method.

关键词： Long Short-Term Memory transformer data compression smart grid arithmetic 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

来源：评论

学校读者我要写书评

暂无评论

Medical Image Compression Using Wrapping Based Fast Discrete Curvelet Transform and arithmetic coding

引用

Circuits and Systems 2016年第8期7卷 2059-2069页

作者： P. Anandan R. S. Sabeenian Department of Electronics and Communication Engineering R.M.D. Engineering College Kavaraipettai India Department of Electronics and Communication Engineering SONA College of Technology Salem India

Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. has enhanced the distinguishing rate and scanning rate of the imaging equipments. The diagnosis and the process of getting useful information from the image are got by processing the medical images using the wavelet technique. Wavelet transform has increased the compression rate. Increasing the compression performance by minimizing the amount of image data in the medical images is a critical task. Crucial medical information like diagnosing diseases and their treatments is obtained by modern radiology techniques. Medical Imaging (MI) process is used to acquire that information. For lossy and lossless image compression, several techniques were developed. Image edges have limitations in capturing them if we make use of the extension of 1-D wavelet transform. This is because wavelet transform cannot effectively transform straight line discontinuities, as well geographic lines in natural images cannot be reconstructed in a proper manner if 1-D transform is used. Differently oriented image textures are coded well using Curvelet Transform. The Curvelet Transform is suitable for compressing medical images, which has more curvy portions. This paper describes a method for compression of various medical images using Fast Discrete Curvelet Transform based on wrapping technique. After transformation, the coefficients are quantized using vector quantization and coded using arithmetic encoding technique. The proposed method is tested on various medical images and the result demonstrates significant improvement in performance parameters like Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).

关键词： Medical Image Compression Discrete Curvelet Transform Fast Discrete Curvelet Transform arithmetic coding Peak Signal to Noise Ratio Compression Ratio

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：