Skip to main content
Log in

Skeleton chain coding for Chinese characters

  • Communication Briefs
  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. P.A. Maragos and R.W. Schafer, “Morphological Skeleton Representation and Coding of Binary Images,”IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-34, no. 5, 1986.

  2. Tung Wei Pai and John H.L. Hansen, “Bit Plane Decomposition and Shape Analysis for Morphological Skeletonization,” inProceedings of SPIE Visual Conference and Image Processing, Boston, 1992, pp. 885–896.

  3. Tung Wei Pai and John H.L. Hansen, “An Improved Image Coding Algorithm Using Morphological Operator Theory,” inProceedings of ICASSP 1991, pp. 2761–2764.

  4. P. Maragos, “Tutorial on Advances in Morphological Image Processing and Analysis,”Optical Engineering, vol. 26, no. 7, 1987.

  5. R.M. Haralick, S.R. Sternberg, and Xinhua Zhuang, “Image Analysis Using Mathematical Morphology,”IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, no. 4, 1987.

  6. D.A. Huffman, “A Method for the Construction of Minimum Redundancy Codes,”Proceedings of the IRE, vol. 40, 1952, pp. 1098–1101.

    Google Scholar 

  7. J. Serra,Image Analysis and Mathematical Morphology, vol. 1, San Diego: Academic Press, 1988.

    Google Scholar 

  8. T.S. Huang, “Coding of Two-Tone Images,”IEEE Transactions on Communications, vol. COM-25, 1987, pp. 1406–1424.

    Google Scholar 

  9. H. Meyr, H.G. Rosdolsky, and T.S. Huang, “Optimum Run-Length Codes,”IEEE Transactions on Communications, vol. COM-22, 1974, pp. 826–835.

    Google Scholar 

  10. P. Elias, “Predictive Coding. Part I,”IRE Transactions on Information Theory, vol. IT-2, 1955, pp. 16–33.

    Google Scholar 

  11. M.R. Garey and D.S. Johnson,Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979.

  12. T. Pavlidis,Algorithms for Graphics and Image Processing, 1982.

  13. R.C. Gonzalez and R.E. Woods,Digital Image Processing, 2nd ed., Reading, MA: Addison-Wesley.

  14. R.C. Gonzalez and P. Wintz,Digital Image Processing, Reading, MA: Addison-Wesley, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, LW., Chuag, Sk. & Yu, Ss. Skeleton chain coding for Chinese characters. Multidim Syst Sign Process 5, 319–330 (1994). https://doi.org/10.1007/BF00980714

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00980714

Key Words

Navigation