A Shape Analysis Model with Applications to a Character Recognition System

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 16, Issue 4, 1994, Pages 393-404

  Rocha, Jairo ^a   Pavlidis, Theo ^b  

^a UNIVERSITAT DE LES ILLES BALEARS   (Spain)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

broken character recognition; graph matching; relative neighborhood graph; Shape distance; subgraph homeo morphism

Indexed keywords

AUTOMATION; CODES (SYMBOLS); INTERACTIVE COMPUTER GRAPHICS; KNOWLEDGE BASED SYSTEMS;

GRAPH MATCHING; RELATIVE NEIGHBORHOOD GRAPH; SHAPE ANALYSIS MODELS; SHAPE DISTANCE; SUBGRAPH HOMEOMORPHISM;

CHARACTER RECOGNITION;

EID: 0028405430     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.277592     Document Type: Article

References (20)

1. S. Mori, C. Suen and K. Yamamoto, “Historical review of OCR research and development,” IEEE Proc., vol. 80, pp. 1029–1058, July 1992.
2. S. Kahan, T. Pavlidis, and H. S. Baird, “On the recognition of printed characters of any font and size,” IEEE Trans. Pattern Anal. Machine Intell., vol. 9, no. 2, pp. 274–288, 1987.
3. M. Bokser, “Omnidocument technologies,” IEEE Proc., vol. 80, pp. 1066–1078, July 1992.
4. S. Rice, J. Kanai, and T. Nartker, “A report on the accuracy of OCR devices,” Information Science Research Inst., Univ. of Nevada, Las Vegas, Tech. Rep., 1992.
5. L. Lam and C. Suen, “Structural classification and relaxation matching of totally unconstrained handwritten zip-code numbers,” Pattern Recogn., vol. 21, no. 1, pp. 19–31, 1988.
6. J. Hoperoft and J. Wong, “Linear time algorithm for isomorphism of planar graphs,” in Proc. 6th Annual ACM Symp. Theory of Computing, New York, pp. 172–184, April, 1974.
7. S. Xie and M. Suk, “On machine recognition of hand printed Chinese characters by feature relaxation,” Pattern Recogn., vol. 21, no. 1, pp. 1–7, 1988.
8. S. Lu, Y. Ren, and C. Suen, “Hierarchical attributed graph representation and recognition of handwritten Chinese characters,” Pattern Recogn., vol. 24, no. 7, pp. 617–632, 1991.
9. H. Yamada, “Contour DP matching method and its application to handprinted Chinese character recognition,” in Proc. 7th Int. Conf. Pattern Recognition, Montreal, Canada, July, 1984, pp. 389–392.
10. L. Wang and T. Pavlidis, “Direct gray scale extraction of features for character recognition,” IEEE Trans. Pattern Anal. Machine Intell., vol. 15, no. 10, pp. 1053–1067, Oct. 1993.
11. G. T. Toussaint, “The relative neighbourhood graph of a finite planar set,” Pattern Recogn., vol. 12, pp. 261–268, 1980.
12. A. Sanfeliu and K. Fu, “A distance measure between attributed relational graphs for pattern recognition,” IEEE Trans. Syst., Man, Cybern., vol. 13, no. 3, pp. 353–362, May 1983.
13. D. Burr, “Elastic matching of line drawings,” in Proc. 5th Int. Conf. Pattern Recognition, Miami Beach, FL, Dec. 1980, pp. 223–228.
14. L. Shapiro and R. Haralick, “Structural descriptions and inexact matching,” IEEE Trans. Pattern Anal. Machine Intell., vol. 3, no. 5, pp. 504–519, Sept. 1981.
15. F. Haray, Graph Theory. New York: Addison-Wesley, 1972, p. 107.
16. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.
17. N. Robertson and P. D. Seymour, “Disjoint paths—A survey,” SIAM J. Algebraic Discrete Methods, vol. 6, pp. 300–305, 1985.
18. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving. Paris: Addison-Wesley. 1984, p. 44.
19. L. Pintsov, “One view of the methodology in handwriting character recognition,” SPIEIIS&Ts Symp. Electronic Imaging, Science and Technology, San Jose, CA, Feb. 9–14, 1992, p. 115.
20. W. J. Sakoda, J. Zhou, and T. Pavlidis, “Feature extraction directly from gray scale with applications to an address recognition sytstem,” Postal Service, 5th. Advanced Technology Conf, Washington, DC, Nov. 30—Dec. 2, 1992, pp. 727–741.