Paul G. Howard, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~jsv/Pape...HoV92.wetech.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: justresearch.com/Encryption_an... (more) Homepages: P.Howard |
Rate this article:      (best)Comment on this article |
Abstract: Arithmetic coding, in conjunction with a suitable probabilistic model, can provide nearly optimal data compression. In this article we analyze the effect that the model and the particular implementation of arithmetic coding have on the code length obtained. Periodic scaling is often used in arithmetic coding implementations to reduce time and storage requirements; it also introduces a recency effect which can further affect compression. Our main contribution is introducing the concept of... (Update)
Context of citations to this paper: More
...so that the image video can be displayed on the y while downloading. We implement our own arithmetic encoder based on the ideas discussed in [12], hence we refrain from describing it in detail. B. Distortion Measures The process of lossy compression can be viewed as adding...
.... Gamma1 i=0 (i 2ffi) This definition corresponds, algorithmically, to the use of a one pass arithmetic coder without modelling [1] . The time required to do one pass arithmetic coding on binary data is linear, and, hence, will be disregarded in our proof of linearity. The...
Cited by: More
Precise Average Redundancy of an Idealized Arithmetic Coding - Drmota, Hwang, Szpankowski (2002) (Correct)
Image Coding Subject to Constraints - Frajka (Correct)
Linear-Time Construction of Optimal Context Trees - Helfgott (Correct)
Similar documents (at the sentence level):
45.4%: The Design and Analysis of Efficient Lossless Data Compression.. - Howard (1993) (Correct)
5.9%: Practical Implementations of Arithmetic Coding - Howard, Vitter (1992) (Correct)
Active bibliography (related documents): More All
0.6: Data Compression - Lelewer, Hirschberg (1987) (Correct)
0.5: Design and Analysis of Fast Text Compression Based on.. - Howard, Vitter (1993) (Correct)
0.4: The Effects of Cascading Popular Text Compression Techniques - Semon (1993) (Correct)
Similar documents based on text: More All
1.6: Fast and Efficient Lossless Image Compression - Howard, Vitter (1993) (Correct)
0.6: Error Modeling for Hierarchical Lossless Image Compression - Howard, Vitter (1995) (Correct)
0.4: Dynamic Generation of Discrete Random Variates - Matias, Vitter, Ni (1997) (Correct)
Related documents from co-citation: More All
16: Compression of individual sequences via variable-rate coding - Ziv, Lempel
12: Arithmetic Coding for Data Compression (context) - Witten, Neal et al.
9: Fido: A Cache That Learns to Fetch (context) - Palmer, Zdonik - 1991
BibTeX entry: (Update)
P. G. Howard and J. S. Vitter, "Analysis of Arithmetic Coding for Data Compression," Information Processing and Management 28 (1992), 749--763, invited paper in Special Issue on Data Compression for Images and Texts. http://citeseer.ist.psu.edu/howard92analysis.html More
@article{ howard92analysis,
author = "Paul G. Howard and Jeffrey Scott Vitter",
title = "Analysis of Arithmetic Coding for Data Compression",
journal = "Information Processing and Management",
volume = "28",
number = "6",
pages = "749-764",
year = "1992",
url = "citeseer.ist.psu.edu/howard92analysis.html" }
Citations (may not include all citations):1447 A Mathematical Theory of Communication (context) - Shannon - 1948
368 Text Compression (context) - Bell, Cleary et al. - 1990
344 Arithmetic Coding for Data Compression (context) - Witten, Neal et al. - 1987
338 A Method for the Construction of Minimum Redundancy Codes (context) - Huffman - 1952
148 Data Compression Using Adaptive Coding and Partial String Ma.. - Cleary, Witten - 1984
139 Stochastic Complexity and Modeling (context) - Rissanen - 1986
137 Universal Codeword Sets and Representations of Integers (context) - Elias - 1975
95 The Zero Frequency Problem: Estimating the Probabilities of .. (context) - Witten, Bell - 1991
78 Universal Coding, Information, Prediction, and Estimation (context) - Rissanen - 1984
75 Stochastic Complexity (context) - Rissanen - 1987
72 A Locally Adaptive Data Compression Scheme (context) - Bentley, Sleator et al. - 1986
50 An Overview of the Basic Principles of the Q-Coder Adaptive .. (context) - Pennebaker, Mitchell et al. - 1988
48 An Introduction to Arithmetic Coding (context) - Langdon - 1984
45 Dynamic Huffman Coding (context) - Knuth - 1985
44 Compression of Black-White Images with Arithmetic Coding (context) - Langdon, Rissanen - 1981
35 Modeling for Text Compression (context) - Bell, Witten et al. - 1989
35 Data Compression Using Dynamic Markov Modelling - Cormack, Horspool - 1987
32 Generalized Kraft Inequality and Arithmetic Coding (context) - Rissanen - 1976
23 Practical Implementations of Arithmetic Coding - Howard, Vitter - 1992
22 Source Coding Algorithms for Fast Data Compression (context) - Pasco - 1976
15 Arithmetic Stream Coding Using Fixed Precision Registers (context) - Rubin - 1979
15 Interval and Recency Rank Source Coding: Two On-line Adaptiv.. - Elias - 1987
14 A Multiplication-Free Multialphabet Arithmetic Code (context) - Rissanen, Mohiuddin - 1989
13 Algorithms for Adaptive Huffman Codes (context) - Cormack, Horspool - 1984
7 A Comparison of Enumerative and Adaptive Codes (context) - Cleary, Witten - 1984
5 High Efficiency, Multiplication Free Approximation of Arithm.. (context) - Chevion, Karnin et al. - 1991
5 Data Compression by Means of a Book Stack (context) - Ryabko - 1980
3 Adaptive Model for Nonstationary Sources (context) - Mohiuddin, Rissanen et al. - 1986
2 Almost Asymptotically Optimal Flag Encoding of the Integers (context) - Wang - 1988
2 Method for Adaptively Initializing a Source Model for Symbol.. (context) - Arps, Langdon et al. - 1984
2 Robust Universal Complete Codes as Alternatives to Huffman C.. (context) - Fraenkel, Klein - 1985
2 Probabilistic and Q-Coder Algorithms for Binary Source Adapt.. (context) - Langdon - 1991
2 On Encoding of Commas Between Strings (context) - Stone - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cora.justresearch.com/Encryption_and_Compression/Compression/): More
Study of DCT coefficient distributions - Smoot (1996) (Correct)
Large Object Support in POSTGRES - Stonebraker, Olson (1993) (Correct)
Localized Multicast Routing - Shaikh, Lu, Shin (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC