13 October 1987 Image Coding For Chinese Character Patterns
Author Affiliations +
Proceedings Volume 0845, Visual Communications and Image Processing II; (1987) https://doi.org/10.1117/12.976486
Event: Cambridge Symposium on Optics in Medicine and Visual Image Processing, 1987, San Diego, CA, United States
Some noiseless data compression methods are introduced in this paper. By using these methods, we compress Chinese character patterns to save storage space. Since quality is very important for Chinese Character patterns, the patterns have to return to their original forms after decoding. Before coding, we first process the patterns by memorizing the changing points, rearranging pattern pixels and prediction function to improve the probability of some specific source symbols in analysis. After the preprocessing stated above, we use m*n subblock or run-length as the source symbol in Huffman coding and compare the results for each method. Our highest compression rate is 70%.
© (1987) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsann-Shyong Liu, Tsann-Shyong Liu, Bor-Shenn Jeng, Bor-Shenn Jeng, Gan-How Chang, Gan-How Chang, Rong-Hauh Ju, Rong-Hauh Ju, } "Image Coding For Chinese Character Patterns", Proc. SPIE 0845, Visual Communications and Image Processing II, (13 October 1987); doi: 10.1117/12.976486; https://doi.org/10.1117/12.976486

Back to Top