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

Parallel lossless image compression using Huffman and arithmetic coding

INFORMATION PROCESSING LETTERS 1996年第2期59卷 65-73页

作者： Howard, PG Vitter, JS DUKE UNIV DEPT COMP SCI DURHAM NC 27708 USA AT&T BELL LABS RES VISUAL COMMUN RES HOLMDEL NJ 07733 USA BROWN UNIV PROVIDENCE RI 02912 USA

We show that high-resolution images can be encoded and decoded efficiently in parallel, We present an algorithm based on the hierarchical MLP method, used either with Huffman coding or with a new variant of arithmetic coding called quasi-arithmetic coding. The coding step can be parallelized, even though the codes for different pixels are of different lengths;parallelization of the prediction and error modeling components is straightforward.

关键词： data compression Huffman coding arithmetic coding parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Block-based wavelet transform coding of mammograms with region adaptive quantization

Block-based wavelet transform coding of mammograms with regi...

引用

Conference on Image Display - Medical Imaging 1998

作者： Moon, NS Song, JS Kwon, M Kim, JH Lee, CW Seoul Natl Univ Sch Elect Engn Inst New Media & Commun Seoul 151 South Korea

ISBN: (纸本)0819427802

To acheive both high compression ratio and information preserving, it is an efficiet way to combine segmentation and lossy compression scheme. Microcalcification in mammogram is one of the most significant sign of early stage of breast cancer. Therefore in coding, detection and segmentation of microcalcification enable us to preserve it well by allocating more bits to it than to other regions. Segmentation of microcalcification is performed both in spatial domain and in wavelet transform domain. Peak error controllable quantization step, which is off-line designed, is suitable for medical image compression. For region-adaptive quantization, block-based wavelet transform coding is adopted and different peak-error-constrained quantizers are applied to blocks according to the segmentation result. In view of perservation of microcalcification, the proposed coding scheme shows better performance than JPEG.

关键词： block-based wavelet transform coding peak error controllable quantization arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Hierarchical dictionary model and dictionary management policies for data compression

引用

SIGNAL PROCESSING 1998年第2期69卷 149-155页

作者： Yu, CL Wu, JL Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan

In this paper, an adaptive multi-dictionary model for data compression is proposed. Dictionary techniques applied in lossless compression coding can be modeled from the dictionary management point of view which is similar to that of cache memory. The behavior of a compression technique can be described by nine parameters defined in the proposed model, which provides a unified framework to describe the behavior of lossless compression techniques including existing probability-based Huffman coding and arithmetic coding, and dictionary-based LZ-family coding and its variants. Those methods can be interpreted as special cases under the proposed model. New compression techniques can be developed by choosing proper management policies in order to meet special encoding/decoding software or hardware requirements, or to achieve better compression performance. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： Huffman coding arithmetic coding LZ coding dictionary management

来源：评论

学校读者我要写书评

暂无评论

Transmission error detection and concealment in JPEG images

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 1998年第1期13卷 45-64页

作者： Abdat, M Al Kachouh, Z Bellanger, MG Conservatoire Natl Arts & Metiers Elect Lab F-75141 Paris 03 France

The robustness to transmission errors of JPEG coded images is investigated and techniques are proposed to reduce their effects. After an analysis of the JPEG transfer format, three main classes of transfer format constituents are distinguished, and a JPEG compatible approach is proposed to stop error propagation in the entropy coded data, with encoder and decoder reset after fixed coding interval lengths. With the use of restart intervals, the propagation of errors is stopped but no correction has taken place. Therefore, a concealment procedure is defined acid investigated. It consists of two steps. First, error detection must be performed and three different techniques are assessed and compared. Then, block error concealment is achieved. Simulation results are reported. Depending on the entropy coding and on the neighborhood templates used for detection and concealment, prediction based or interpolation based, improvements between 3 and 10dB in peak-to-peak signal-to-noise ratios (PSNR) are provided by the robust decoder with respect to conventional JPEG decoders, for bit error rates around 10(-4). (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： image compression JPEG Huffman coding arithmetic coding transmission errors error detection error concealment

来源：评论

学校读者我要写书评

暂无评论

On a new remote sensing data compression technique using wavelet decomposition and related procedures 4

On a new remote sensing data compression technique using wav...

引用

Conference on Image and Signal Processing for Remote Sensing IV

作者： Chen, CH Cheng, TH Univ Massachusetts Dept Elect & Comp Engn N Dartmouth MA 02747 USA

ISBN: (纸本)0819429597

Many image compression techniques have been developed for remote sensing imagery over the last thirty years. What are considered as standard techniques such as the use of principal component analysis, discrete cosine transform, predictive coding, etc. have shown their limitations. Wavelet transform techniques have been increasingly used in recent years. In this paper a new and efficient technique is presented that provides a nearly lossless compression of the multichannel remote sensing imagery by combining the use of wavelet decomposition, non-uniform quantization, arithmetic coding, and geometric vector quantizer (GVQ) to achieve the compression task with very minimal loss. The detailed procedures will be illustrated with real remote sensing images.

关键词： image compression wavelet transform vector quantization arithmetic coding remote sensing SAR images

来源：评论

学校读者我要写书评

暂无评论

Lossless and nearly-lossless compression of multispectral SPOT images

引用

Conference on Nonlinear Image Processing IX

作者： Mozelle, G Zaharia, T Preteux, F Cabot, F Inst Natl Telecommun Dept Signal & Image F-91011 Evry France

ISBN: (纸本)0819427446

In this paper, we address the problem of lossless and nearly-lossless multispectral compression of remote-sensing data acquired using SPOT satellites. Lossless compression algorithms classically have two stages: Transformation of the available data, and coding. The purpose of the first stage is to express the data as uncorrelated data in an optimal way. In the second stage, coding is performed by means of an arithmetic coder. In this paper, we discuss two well-known approaches for spatial as well as multispectral compression of SPOT images: 1) The efficiency of several predictive techniques (MAP, CALIC, 3D predictors), are compared, and the advantages of 2D versus 3D error feedback and context modeling are examinated;2) The use of wavelet transforms for lossless multispectral compression are discussed. Then, applications of the above mentionned methods for quincunx sampling are evaluated. Lastly, some results, on how predictive and wavelet techniques behave when nearly-lossless compression is needed, are given.

关键词： lossless and nearly-lossless multispectral image compression 2D and 3D predictive techniques, JPEG-LS context modeling arithmetic coding wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

High-fidelity coding for super high-definition images

引用

Electronics and Communications in Japan (Part I: Communications) 1998年第3期80卷

作者： Yoshimitsu Kuroki Teiji Ohta Faculty of Engineering Kyushu Institute of Technology Kitakyushu Japan 804

The super high-definition images (SHDI) expected to be prominent in the systems of the 21st century consist of approximately 4000 scan lines and have extremely high fidelity. This paper describes a coding scheme for still SHDI. Predictive coding is thought to be a coding technique capable of not spoiling the quality of SHDI images. Thus, an extrapolative/interpolative prediction scheme that has been proposed [1] for high-efficiency coding of HDTV is used for intraframe coding of SHDI. The extrapolative prediction error is coded with a first-order Huffman code. Comparatively, the prediction efficiency of interpolative prediction is superior to that of extrapolative prediction [2]. Furthermore, since the pixel correlations of the images used in this paper are extremely high [9], the probability of the 0 representative level of the quantizer is high. Thus, in this paper, the prediction error is converted to binary levels when interpolative prediction is used and it is proposed that a coding method based on a type of arithmetic code, the QM-Coder [4], which is used in JPEG, be used to code the resulting binary information. When binary information is coded, the resulting conditional entropy of the reference pixels is shown to be rather constant; and, thus, the number of states can be reduced without an increase in the rate. Image coding simulation results show that the coding performance is improved with this method where extrapolative/interpolative prediction is used by 0.350 ∼ 0.458 bits/pel when compared with the case that uses a first-order Huffman code. Accordingly, high-fidelity images whose signal-to-noise ratio (SNR) is greater than 50 dB with rates less than at 1.653 bits/pel are obtained. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 1, 80(3): 47–57, 1997

关键词： super high-definition images arithmetic coding QM-coder extrapolative/interpolative prediction quantization

来源：评论

学校读者我要写书评

暂无评论

Novel design of arithmetic coding for data compression

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1995年第6期142卷 419-424页

作者： Jiang, J Dept. of Comput. Sci. Loughborough Univ. of Technol. UK

The paper presents a novel software and hardware design of a universal arithmetic coding algorithm where 256 ASCII codes of symbols, as a specific example, are in the alphabet. Essentially. the two coding equations are modified by specifying the code values as the lower end-point value of the coding range and the width of this range. Therefore the procedures of sending output codes, solving the so-called underflow problem, and updating the coding range can be unified and simply controlled by the value of the coding range. As a result, a hardware architecture can be directly designed to implement the algorithm on real-time basis where the single operation of normalisation can be implemented in parallel. In addition, specific design of decoding the compressed output, theoretical analysis and realtime architectures of both encoding and decoding are described. Practical C source codes of main functions and experimental results are also reported.

关键词： arithmetic coding data compression algorithm design signal processing

来源：评论

学校读者我要写书评

暂无评论

ON THE INSECURITY OF arithmetic coding

引用

COMPUTERS & SECURITY 1995年第2期14卷 167-180页

作者： CLEARY, JG IRVINE, SA RINSMAMELCHERT, I UNIV WAIKATO SCH COMP & MATH SCI PRIVATE BAG 3105 HAMILTON NEW ZEALAND

arithmetic coding is a technique which converts a given probability distribution into an optimal code and is commonly used in compression schemes. The use of arithmetic coding as an encryption scheme is considered. The simple case of a single binary probability distribution with a fixed (but unknown) probability is considered. We show that for a chosen plaintext attack w+2 symbols is sufficient to uniquely determine a w-bit probability. For many known plaintexts w+m+O(logm) symbols, where m is the length of an initial sequence containing just one of (the two possible) symbols, is sufficient. It is noted that many extensions to this basic scheme are vulnerable to the same attack provided the arithmetic coder can be repeatedly reset to its initial state. If it cannot be reset then their vulnerability remains an open question.

关键词： DATA COMPRESSION arithmetic coding FIXED MODELS CRYPTANALYSIS KNOWN PLAINTEXT ATTACK

来源：评论

学校读者我要写书评

暂无评论

Interval algorithm for random number generation

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第2期43卷 599-611页

作者： Han, TS Hoshi, M Sch. of Inf. Syst. Univ. of Electro-Commun. Tokyo Japan Graduate School of Information Systems University of Electro-Communications Chofu Tokyo Japan

The problem of generating a random number with an arbitrary probability distribution by using a general biased M-coin is studied, An efficient and very simple algorithm based on the successive refinement of partitions of the unit interval [0, 1), which we call the interval algorithm, is proposed, A fairly tight evaluation on the efficiency is given, Generalizations of the interval algorithm to the following cases are investigated: 1) output sequence is independent and identically distributed (i.i.d.);2) output sequence is Markov;3) input sequence is Markov;4) input sequence and output sequence are both subject to arbitrary stochastic processes.

关键词： random number generation interval algorithm partitions entropy biased coin arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：