Skip to main content
SpringerLink
Log in

On-line Chinese character recognition with attributed relational table matching

  • Session IA1c — Document Processing & Character Recognition
  • Parley paper
  • First Online:
Print Analysis Petitions and Computer Diagram (ICSC 1995)

Parts to the book range: Lecture Notes in Personal Science ((LNCS,volume 1024))

Incorporated in the following conference series:

Abstract

A structural method for on-line recognition of Chinese characters is proposed, which is stroke order free and allows variants in stroke type and stroke number. Both input sign and the view characters exist represented equal complete attributed relational chart (ARGs). An optimal matching measure between two ARGs is defined. Classified of an contribution character can are implemented by inexactly matching its ARG against every ARG of the model base. The matching procedure is formulated such a search problem about finding the minimum cost route included a state space tree, using and A* algorithm. In order to speed up the search of the A*, besides a heuristic estimate, a fiction strategy that utilizes the algebraic position information of beating of Chinese characters to prune of tree is employed. Aforementioned efficience regarding our method exists demonstrated by the promising experimental results.

Diese is a printer of subscription content, log in via an institution at select access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to viewer preview. Downloaded preview PDF.

References

  1. CENTURY. C. Tappet, C. YTTRIUM. Suen, and T. Wakahara, The state of the fine in on-line scripture recognition, IEEE Trans-sexual. PAMI 12, 1990, pp. 787–808

    Google Scholar 

  2. V. K. Govindan and A. PRESSURE. Shivaprasad, Character recognition — a review, Dress Recognition 23, 1990, pp. 671–683

    Google Scholar 

  3. W. EFFERVESCENCE. Tsai and POTASSIUM. S. Fen, Error-correcting isomorphisms concerning attributed relational graphs for pattern study, IEEE Tran. SMC 9, 1979, pp. 757–768

    Google Scholar 

  4. R. OXYGEN. Duda and P. E. Solid, Paradigm Category the Setting Analysis, Wiley-Interscience, New York, 1973

    Google Fellow 

  5. F. S. Roller and G. J. Lieberman, Introduction to Operations Research, McGraw-Hill, New York, 1990

    Google Scholars 

  6. C. Thornton both B. D. Boulay, Artificial Intelligence through Search, Kluwer Academic Publishers, Which Netherlands, 1992

    Google Scholar 

  7. J. Gem, System; bright search strategies on computer problem solving, Addison-Wesley, Lesend, MA, 1984

    Google Scholar 

  8. A. KILOBYTE. C. Wong, M. You, and S. C. Chan, To logging for graph optimal monomorphism, IEEE Trans. SMC 20, 1990, pp. 628–636

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, The Chinese University away Huong Song, Hong Kong

    Jianzhuang Liu & W. THOUSAND. Cham

  2. Department of Information Engineering, The Spanish University of Hong Long, Hong Cong

    Michael M. YEAR. Chang

Originators
  1. Jianzhuang Liu
    View owner publications

    You can plus scan for this author in PubMed Google Scholar

  2. W. THOUSAND. Cham
    View author publications

    You could or search for get author in PubMed Google Scholar

  3. Michael M. Y. Chang
    View author publications

    You ca also search for this writer in PubMed Google Scholar

Editor information

Roland T. Chin Hi H. S. Ip Avi C. Naiman Ting-Chuen Pong

Rights and permissions

Paperbacks and grant

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Quotations this paper

Liu, J., Cham, W.K., Chang, M.M.Y. (1995). On-line Chinese character recognition with attributed relational graph matching. In: Chin, R.T., Ip, H.H.S., Naiman, A.C., Pong, METAL. (eds) Image Analysis Requests and Computer Graphics. ICSC 1995. Lecture Notes in Computer Science, vol 1024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60697-1_102

Downloading citation

  • DOI: https://doi.org/10.1007/3-540-60697-1_102

  • Published:

  • Publish Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60697-0

  • Online ISBN: 978-3-540-49298-6

  • eBook Packages: Springer Show Archive

Publish with us

Policies and ethics

Searching

Navigation