Share Email Print

Proceedings Paper

Lossy coding scheme of binary character patterns
Author(s): Tadahiko Kimoto; Masayuki Tanimoto
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

To transmit facsimile images through a very low bit-rate channel such as the half-rate mobile channel, a very efficient coding scheme for data compression is required. Lossy coding is expected to perform more data reduction than that achieved by the conventional lossless coding schemes. This paper discusses approximate representation of scanned character patterns for data reduction. First, the quality of character patterns is considered in terms of the size of patterns. According to this consideration, the attributes of scanned character patterns and the quality associated with them are assumed. For preserving quality under approximation, a character pattern is described by a set of strokes in tree data structure.

Paper Details

Date Published: 21 April 1995
PDF: 6 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206771
Show Author Affiliations
Tadahiko Kimoto, Nagoya Univ. (Japan)
Masayuki Tanimoto, Nagoya Univ. (Japan)

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top