Lossy coding scheme of binary character patterns

Tadahiko Kimoto; Masayuki Tanimoto

doi:10.1117/12.206771

21 April 1995 Lossy coding scheme of binary character patterns

Tadahiko Kimoto, Masayuki Tanimoto

Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206771
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan

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.

Citation Download Citation

Tadahiko Kimoto and Masayuki Tanimoto "Lossy coding scheme of binary character patterns", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206771

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available