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

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

来源：评论

学校读者我要写书评

暂无评论

Embedded block coding in JPEG 2000

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2002年第1期17卷 49-72页

作者： Taubman, D Ordentlich, E Weinberger, M Seroussi, G Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia GlobeSpan Santa Clara CA USA Hewlett Packard Labs Palo Alto CA USA

This paper describes the embedded block coding algorithm at the heart of the JPEG 2000 image compression standard, The paper discusses key considerations which led to the development and adoption of this algorithm, and also investigates performance and complexity issues, The JPEG 2000 coding system achieves excellent compression performance, somewhat higher (and, in some cases, substantially higher) than that of SPIHT with arithmetic coding, a popular benchmark for comparison The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design of the bit-plane coding primitives, this enables comparable execution speed to that observed with the simpler variant of SPIHT without arithmetic coding. The coder offers additional advantages including memory locality, spatial random access and ease of geometric manipulation. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： JPEG 2000 image compression scalable compression embedded coding bit-plane coding arithmetic coding wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Context modeling for near-lossless image coding

引用

IEEE SIGNAL PROCESSING LETTERS 2002年第3期9卷 77-80页

作者： Aiazzi, B Alparone, L Baronti, S CNR IROE Nello Carrara Res Inst Electromagnet Waves I-50127 Florence Italy Univ Florence Dept Elect & Telecommun I-50139 Florence Italy

This letter describes a context-based entropy coding suitable for any causal spatial differential pulse code modulation (DPCM) scheme performing lossless or near-lossless image coding. The proposed method is based on partitioning of prediction errors into homogeneous classes before arithmetic coding. A context function is measured on prediction errors lying within a two-dimensional (2-D) causal neighborhood, comprising the prediction support of the current pixel, as the root mean square (RMS) of residuals weighted by the reciprocal of their Euclidean distances. Its effectiveness is demonstrated in comparative experiments concerning both lossless and near-lossless coding. The proposed context coding/decoding is strictly real-time.

关键词： arithmetic coding DPCM entropy coding near-lossless coding statistical context modeling

来源：评论

学校读者我要写书评

暂无评论

Embedded morphological dilation coding for 2D and 3D images

Embedded morphological dilation coding for 2D and 3D images

引用

Conference on Visual Communications and Image Processing 2002

作者： Lazzaroni, F Signoroni, A Leonardi, R Univ Brescia DEA Signals & Commun Lab I-25123 Brescia Italy

ISBN: (纸本)0819444111

Current wavelet-based image coders obtain high performance thanks to the identification and the exploitation of the statistical properties of natural images in the transformed domain. Zerotree-based algorithms, as "Embedded Zerotree Wavelets" (EZW) and "Set Partitioning In Hierarchical Trees" (SPIHT), offer high Rate-Distortion (RD) coding performance and low computational complexity by exploiting statistical dependencies among insignificant coefficients on hierarchical subband structures. Another possible approach tries to predict the clusters of significant coefficients by means of some form of morphological dilation. An example of a morphology-based coder is the "Significance-Linked Connected Component Analysis" (SLCCA) that has shown performance which are comparable to the zerotree-based coders but is not embedded. A new embedded bit-plane coder is proposed here based on morphological dilation of significant coefficients and context based arithmetic coding. The algorithm is able to exploit both intra-band and inter-band statistical dependencies among wavelet significant coefficients. Moreover, the same approach is used both for two and three-dimensional wavelet-based image compression. Finally the algorithms are tested on some 2D images and on a medical volume, by comparing the RD results to those obtained with the state-of-the-art wavelet-based coders.

关键词： 2D and 3D image coding wavelet transform embedding arithmetic coding morphology

来源：评论

学校读者我要写书评

暂无评论

Compression of TPC data in the ALICE experiment

引用

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2002年第3期487卷 542-556页

作者： Nicolaucig, A Mattavelli, M Carrato, S Swiss Fed Inst Technol LSI ISL Integrated Syst Lab CH-1015 Lausanne Switzerland Univ Trieste DEEI Image Proc Lab I-34127 Trieste Italy

In this paper two algorithms for the compression of the data generated by the Time Projection Chamber (TPC) detector of the ALICE experiment at CERN are described. The first algorithm is based on a lossless source code modeling technique., i.e. the original TPC signal information can be reconstructed without errors at the decompression stage. The source model exploits the temporal correlation that is present in the TPC data to reduce the entropy of the source. The second algorithm is based on a source model which is lossy if samples of the TPC signal are considered one by one. Conversely, the source model is lossless or quasi-lossless if some physical quantities that are of main interest for the experiment are considered. These quantities are the area and the location of the center of mass of each TPC signal pulse. Obviously entropy coding is applied to the set of events defined by the two source models to reduce the bit rate to the corresponding source entropy. Using TPC simulated data according to the expected ALICE TPC performance, the lossless and the lossy compression algorithms achieve a data reduction, respectively, to 49.2% and in the range of 34.2% down to 23.7% of the original data rate. The number of operations per input symbol required to implement the compression stage for both algorithms is relatively low, so that a real-time implementation embedded in the TPC data acquisition chain using low-cost integrated electronics is a realistic option to effectively reduce the data storing cost of ALICE experiment. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： ALICE TPC compression lossless lossy arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Progressive space frequency quantization for SAR data compression

引用

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 2002年第1期40卷 3-10页

作者： Gleich, D Planinsic, P Gergic, B Cucej, Z Univ Maribor Fac Elect Engn & Comp Sci Signal Proc Lab SLO-2000 Maribor Slovenia

In this paper, we propose a new wavelet image coding technique for synthetic aperture radar (SAR) data compression called a progressive space-frequency quantization (PSFQ). PSFQ performs spatial quantization via rate distortion-optimized zerotree pruning of wavelet coefficients that are coded using a progressive subband coding technique. We compared the performances of zerotree-based methods: EZW, SPIRT, SFQ, and PSFQ with the classical wavelet-based method (CWM), which uses uniform scalar quantization of subbands followed by recency rank coding. The performances of the methods based on zerotree quantization were better than the CWM in the rate distortion sense. The embedded coding techniques perform better SNR results than the methods using scalar quantization. However, the probability density function (PDF) of the reconstructed amplitude SAR data compressed using CWM, better corresponded to the PDF of the original data than the PDF of the reconstructed data compressed using the zerotree based methods. The amplitude PDF of the reconstructed data obtained using PSFQ compression algorithm better corresponded to the original PDF than the amplitude PDF of the data obtained using the multilook method.

关键词： arithmetic coding compression radar synthetic aperture radar (SAR) wavelet transform zerotree coding

来源：评论

学校读者我要写书评

暂无评论

2D-pattern matching image and video compression: Theory, algorithms, and experiments

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2002年第3期11卷 318-331页

作者： Alzina, M Szpankowski, W Grama, A Ecole Natl Super Telecommun Bretagne F-75013 Paris France Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

In this paper, we propose a lossy data compression framework based on an approximate two-dimensional (2D) pattern matching (2D-PMC) extension of the Lempel-Ziv lossless scheme. This framework forms the basis upon which higher level schemes relying on differential coding, frequency domain techniques, prediction, and other methods can be built. We apply our pattern matching framework to image and video compression and report on theoretical and experimental results. Theoretically, we show that the fixed database model used for video compression leads to suboptimal but computationally efficient performance. The compression ratio of this model is shown to tend to the generalized entropy. For image compression, we use a growing database model for which we provide an approximate analysis. The implementation of 2D-PMC is a challenging problem from the algorithmic point of view. We use a range of techniques and data structures such as k-d trees, generalized run length coding, adaptive arithmetic coding, and variable and adaptive maximum distortion level to achieve good compression ratios at high compression speeds. We demonstrate bit rates in the range of 0.25-0.5 bpp for high-quality images and data rates in the range of 0.15-0.5 Mbps for a baseline video compression scheme that does not use any prediction or interpolation. We also demonstrate that this asymmetric compression scheme is capable of extremely fast decompression making it particularly suitable for networked multimedia applications.

关键词： approximate pattern matching arithmetic coding generalized run-length coding generalized Shannon entropy k-d trees Lempel-Ziv schemes multimedia compression rate distortion

来源：评论

学校读者我要写书评

暂无评论

Signal-dependent wavelet transform and application to lossless image compression

引用

ELECTRONICS LETTERS 2002年第4期38卷 170-172页

作者： Yoo, H Joeng, J Hanyang Univ Dept Elect Commun Engn Seoul 133791 South Korea

A signal-dependent wavelet transform based on the lifting scheme is proposed. The transform can be made reversible (i.e. an integer-to-integer transform). The reversible transform. followed by arithmetic coding, is applied to lossless image compression. Simulation results indicate that the proposed method is superior to the S + P method.

关键词： wavelet transforms arithmetic coding simulation lifting scheme data compression Image and video coding arithmetic codes reversible transform signal-dependent wavelet transform Integral transforms image coding S+P method integer-to-integer transform lossless image compression Computer vision and image processing techniques Image recognition

来源：评论

学校读者我要写书评

暂无评论

Families of ternary sequences with aperiodic zero correlation zones for MC-DS-CDMA

引用

ELECTRONICS LETTERS 2002年第25期38卷 1660-1661页

作者： Donelan, H O'Farrell, T Univ Leeds Dept Elect & Elect Engn Inst Entegrated Informat Syst Leeds LS2 9JT W Yorkshire England

A new method for generating ternary spreading sequences with aperiodic zero correlation zones and large family sizes is presented. The sequences are proposed as spreading sequences to provide high capacity and cancel ... 详细信息

关键词： .zones arithmetic coding MC-DS-CDMA family sizes Zero correlation zone ZCZ

来源：评论

学校读者我要写书评

暂无评论

An embedded wavelet packet image coding algorithm

An embedded wavelet packet image coding algorithm

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Hou, XS Liu, GZ Li, HL Li, YL Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China

ISBN: (纸本)0780374029

In this paper, we presented a novel wavelet packet image coding approach which provides the functionality of fine granular bitstream scalability. The proposed progressive wavelet packet image coding scheme consists of three parts, wavelet packet decomposition, a quadtree sorting procedure for classifying wavelet coefficients and universal trellis-coded quantization for quantizing the sorted coefficients. The image coding results, calculated in PSNR and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results, due to the flexible representation ability of wavelet packet, the effective quadtree classifier and the improved granular fidelity of the UTCQ over scalar quantization.

关键词： image coding quantisation (signal) wavelet transforms transform coding quadtrees sorting image reconstruction decoding arithmetic codes embedded wavelet packet image coding fine granular bitstream scalability quadtree sorting procedure universal trellis-coded quantization PSNR image reconstruction scalar quantization arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：