scispace - formally typeset
Journal ArticleDOI

International digital facsimile coding standards

R. Hunter, +1 more
- Vol. 68, Iss: 7, pp 854-867
TLDR
The coding schemes in detail are described in detail and the factors which led to their choice are discussed, and the performance of the codes is assessed, particularly in relation to their compression efficiency and vulnerability to transmission errors.
Abstract
Recently Study Group XIV of CCITT has drafted a new Recommendation (T.4) with the aim of achieving compatibility between digital facsimile apparatus connected to general switched telephone networks. A one-dimensional coding scheme is used in which run lengths are encoded using a modified Huffman code. This allows typical A4 size documents in the form of black and white images scanned at normal resolution (3.85 lines/mm, 1728 pels/line) to be transmitted in an average time of about a minute at a rate of 4800 bit/s. The Recommendation also includes a two-dimensional code, known as the modified relative element address designate (READ) code, which is in the form of an optional extension to the one-dimensional code. This extension allows typical documents scanned at high (twice normal) resolution (with every fourth line one dimensionally coded) to be transmitted in an average time of about 75 s at 4800 bit/s. This paper describes the coding schemes in detail and discusses the factors which led to their choice. In addition, this paper assesses the performance of the codes, particularly in relation to their compression efficiency and vulnerability to transmission errors, making use of 8 CCITT reference documents.

read more

Citations
More filters
Journal ArticleDOI

Arithmetic coding for data compression

TL;DR: The state of the art in data compression is arithmetic coding, not the better-known Huffman method, which gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.
Book

Introduction to data compression

TL;DR: The author explains the development of the Huffman Coding Algorithm and some of the techniques used in its implementation, as well as some of its applications, including Image Compression, which is based on the JBIG standard.
Journal ArticleDOI

Data Compression Using Adaptive Coding and Partial String Matching

TL;DR: This paper describes how the conflict can be resolved with partial string matching, and reports experimental results which show that mixed-case English text can be coded in as little as 2.2 bits/ character with no prior knowledge of the source.
Journal ArticleDOI

Compression of Black-White Images with Arithmetic Coding

TL;DR: A new approach for black and white image compression is described, with which the eight CCITT test documents can be compressed in a lossless manner 20-30 percent better than with the best existing compression algorithms.
Journal ArticleDOI

Modeling for text compression

TL;DR: This paper surveys successful strategies for adaptive modeling that are suitable for use in practical text compression systems, and falls into three main classes: finite-context modeling, in which the last few characters are used to condition the probability distribution for the next one.
References
More filters
Journal ArticleDOI

A Method for the Construction of Minimum-Redundancy Codes

TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI

Variable-length binary encodings

TL;DR: This paper gives a theoretical treatment of several properties which describe certain variable-length binary encodings of the sort which could be used for the storage or transmission of information, such as the prefix and finite delay properties.
Journal ArticleDOI

Errors and error control

TL;DR: It is shown qualitatively that automatic-repeat-request (ARQ) systems are inherently better suited to the task than forward-error-control (FEC) systems.
Journal ArticleDOI

A probabilistic model for run-length coding of pictures

TL;DR: A first-order Markoff process representation for pictures is proposed in order to study the picture coding system known as run-length coding (differential-coordinate encoding), and is shown to yield an insight into the run- length coding system which might not otherwise be obtained.
Journal ArticleDOI

Coding of Two-Tone Images

TL;DR: The concepts and techniques of efficient coding for the transmission or storage of two-tone images, such as business documents and weather maps, are reviewed.