نتایج جستجو برای: arithmetic coding

تعداد نتایج: 158068  

1995
A. B. Kiely

This article presents a study of seismic data compression techniques and a compression algorithm based on subband coding. The algorithm includes three stages: a decorrelation stage, a quantization stage that introduces a controlled amount of distortion to allow for high compression ratios, and a Iossless entropy coding stage based on a simple but efficient arithmetic coding method. Subband codi...

2004
Luis Rueda B. John Oommen

In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of the source symbols. We present the corresponding encoding and decoding algorithms, as well as the details of the probability updating mechanisms. Once these probabilities are estimated, they can be used in a variety of...

1999
Marcelo J. Weinberger Gadiel Seroussi Guillermo Sapiro

lossless image compression, standards LOCO-I (LOw COmplexity LOssless COmpression for Images) is the algorithm at the core of the new ISO/ITU standard for lossless and near-lossless compression of continuous-tone images, JPEG-LS. The algorithm, presented at DCC'96, was conceived as a “low complexity projection” of the universal context modeling paradigm, matching its modeling unit to a simple c...

Journal: :IEEE Trans. Communications 1984
John G. Cleary Ian H. Witten

The recently developed technique of arithmetic coding, in conjunction with a Markov model of the source, is a powerful method of data compression in situations where a linear treatment is inappropriate. Adaptive coding allows the model to be constructed dynamically by both encoder and decoder during the course of the transmission, and has been shown to incur a smaller coding overhead than expli...

2003
Danny Hong Mihaela van der Schaar Béatrice Pesquet-Popescu

We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effectiveness of using the method with that of using the context models specified in the H.264 standard. We then describe a novel approach for automatically adapting the CTW method based ...

2005
HENDRIK EECKHAUT BENJAMIN SCHRAUWEN MARK CHRISTIAENS JAN VAN CAMPENHOUT

The Dirac codec is a new prototype video coding algorithm from BBC R&D based on wavelet technology. Compression-wise the algorithm is broadly competitive with the state-of-the-art video codecs but computational-wise the execution time is currently poor. One of the largest bottlenecks is the arithmetic coder. Hence we took this part under investigation and replaced it with a faster variant, the ...

Journal: :J. Inf. Sci. Eng. 2014
Hee-Suk Pang Jun-Seok Lim Seokjin Lee

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...

Journal: :CoRR 2017
Michal Vasinek Jan Platos

The context transformation and generalized context transformation methods, we introduced recently, were able to reduce zero order entropy by exchanging digrams, and as a consequence, they were removing mutual information between consecutive symbols of the input message. These transformations were intended to be used as a preprocessor for zero-order entropy coding algorithms like Arithmetic or H...

2003
Rafael Redondo Gabriel Cristóbal

This paper proposes an efficient method for lossless coding of gray level edge images, which are frequently used in image processing. The method consists of analyzing the edge image in connected sets of pixels by means of chain coding as a function of its starting points, their relative intensities and their displacements within these sets. In order to avoid the redundant information a DPCM cod...

1997
A. B. Kiely

We describe an image data compression strategy featuring progressive transmission. The method exploits subband coding and arithmetic coding for compression. We analyze the Laplacian probability density, which closely approximates the statistics of individual subbands, to determine a strategy for ordering the compressed subband data in a way that improves rate-distortion performance. Results axe...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید