Font compression and retrieval

Image analysis – Image compression or coding – Lossless compression

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S305000, C358S001110, C345S467000

Reexamination Certificate

active

10913639

ABSTRACT:
Method and apparatus for compressing data representing a set of symbols such that each symbol of the set can be separately accessed and decompressed. Each symbol of the set of symbols is encoded in the form of a two-part code wherein a first part of the code is common for all encoded symbols and a second part of the code encodes the data representing a symbol. An identifier is given for each symbol for permitting each encoded symbol to be separately accessed and decompressed. The invention is particularly useful for storing large fonts such as a Chinese or Japanese character set.

REFERENCES:
patent: 3701111 (1972-10-01), Cocke et al.
patent: 4559615 (1985-12-01), Goo et al.
patent: 4799242 (1989-01-01), Vermeulen
patent: 5020121 (1991-05-01), Rosenberg
patent: 5045852 (1991-09-01), Mitchell et al.
patent: 5058187 (1991-10-01), Kim
patent: 5473704 (1995-12-01), Abe
patent: 5488365 (1996-01-01), Seroussi et al.
patent: 5528628 (1996-06-01), Park et al.
patent: 5587725 (1996-12-01), Sakanishi et al.
patent: 5915041 (1999-06-01), Thielens
patent: 6236342 (2001-05-01), Symes
patent: 6433709 (2002-08-01), Oue
patent: 0 687 995 (1995-12-01), None
patent: 0 745 946 (1996-12-01), None
patent: 0 813 167 (1997-12-01), None
patent: 0 932 883 (2002-03-01), None
patent: 63263561 (1988-10-01), None
patent: 6195063 (1994-07-01), None
patent: 6266531 (1994-09-01), None
patent: 7199894 (1995-08-01), None
patent: 11055125 (1999-02-01), None
patent: WO 98/16902 (1998-04-01), None
patent: WO 99/21075 (1999-04-01), None
Alexandra Duel-Hallen, Delayed Decision-Feedback Sequence Estimation; IEEE Transactions on Communications; vol. 37, No. 5; May 1989; 9 Pages.
C.B. Jones; An Efficient Coding System for Long Source Sequences; IEEE Transactions on Information Theory, vol. 27, No. 3; May 1981; 11 Pages.
D.A. Huffman; A Method for the Construction of Minimum-Redundancy Codes; Proc. IRE; vol. 40, (1952); 3 Pages.
Mu-King Tsay et al.; Data Compression on Multifont Chinese Character Patterns; Mar. 1994; No. 2; 8 Pages.
Makoto Nagao; Data Compression of Chinese Character Patterns; XP00601742; Jul. 1980; vol. 68, No. 7; 12 Pages.
Kuang-Yao Chang et al.; CCIGS: A Data Compression System for Chinese Fonts and Binary Images Using Classification Techniques; XP000655815; Dec. 1992; vol. 22; 21 Pages.
Phil Vines et al.; Compression Techniques for Chinese Text; XP00778145; Oct. 1998; vol. 28; 16 Pages.
Ong et al.; A Semi-Adaptive Arithmetic Coding Scheme for Chinese Textual Data; Proceedings of the IEEE; vol. 2, 5 Pages.
Liu, et al.; Image Coding for Chinese Character Patterns; Proceedings of the SPIE; vol. 845, 1987; 6 Pages.
R.H. Ju, et al.; Global Study on Data Compression Techniques for Digital Chinese Character Patterns; Jan. 1992; No. 1, Part E.; 8 Pages.
Ong et al.; A Data Compression Scheme for Chinese Text Files Using Huffman Coding and a Two-Level Dictionary; Information Sciences; vol. 84, No. 1-2, 15 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Font compression and retrieval does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Font compression and retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Font compression and retrieval will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3721226

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.