Skip to main content
Log in

Strict constraints on 2D primitive pairs for engineering symbol recognition: Theory and application

  • Research Paper
  • Special Focus
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Geometric constraints on the line-line pair, line-arc pair and arc-arc pair are proposed. The constraints are able to encode the geometric relations between lines, arcs and circles. A geometric proof is presented to demonstrate that the constraints are stable under translation, rotation, uniform scaling or reflection of the primitive pairs. Based on the constraints, an algorithm for recognizing symbols in drawings is developed. Experimental results show that, compared with three other methods, our method can distinguish more primitive pairs and has higher accuracy in engineering symbol recognition.

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.

Similar content being viewed by others

References

  1. Tombre K. Graphics recognition: The last ten years and the next ten years. Lect Not Comput Sci, 2006, 3926: 422–426

    Article  Google Scholar 

  2. Nagy G. Twenty years of document image analysis in PAMI. IEEE Trans PAMI, 2000, 22: 38–62

    Article  Google Scholar 

  3. Lladös J. Advances in graphics recognition. Digital Document Processing. London: Springer, 2007. 281–303

    Google Scholar 

  4. GREC 2011. http://grec2011.cau.ac.kr

  5. Phillips I, Chhabra A. Empirical performance evaluation of graphics recognition systems. Patt Anal Mach Intell, 1999, 1: 849–870

    Article  Google Scholar 

  6. Delalandre M, Valveny E, Lladös J. Performance evaluation of symbol recognition and spotting systems: An overview. In: The 8th IAPR International Workshop on Document Analysis Systems, Nara, 2008. 497–505

  7. Zhang D, Lu G. Review of shape representation and description techniques. Patt Recogn, 2004, 37: 1–19

    Article  MATH  Google Scholar 

  8. Tan J R, Yue X L, Lu G D. Basic principle, method of graphic similarity and its application to structure pattern recognition (in Chinese). Chinese J Comput, 2002, 25: 1–9

    MathSciNet  Google Scholar 

  9. Lladös J, Marti E, Villanueva J. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Trans PAMI, 2001, 23: 1137–1143

    Article  Google Scholar 

  10. Mas J, Lamiroy B, Sanchez G, et al. Automatic adjacency grammar generator from user drawn sketches. In: Proceedings of the 18th ICPR, 2006

  11. Mas J, Lamiroy B, Sanchez G, et al. Automatic learning of symbol descriptions avoiding topological ambiguities. In: Proceedings of the 3rd Eurographics Workshop on Sketch-based Interfaces and Modeling, 2006

  12. Luo Y, Liu W. Engineering drawings recognition using a case-based approach. In: International Conference on Document Analysis and Recognition (ICDAR), 2003

  13. Liu W, Zhang W, Luo Y. An interactive example-driven approach to graphics recognition in engineering drawings. Int J Doc Anal Recogn, 2007, 9: 13–27

    Article  Google Scholar 

  14. Li T, Shu B, Qiu X J, et al. A complete descriptor of line-segment-pair for symbol recognition. In: Proceedings of Short and Additional Papers of Computer Graphics International, 2009. 83–89

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ting Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, T., Qiu, X., Huang, H. et al. Strict constraints on 2D primitive pairs for engineering symbol recognition: Theory and application. Sci. China Inf. Sci. 55, 1032–1041 (2012). https://doi.org/10.1007/s11432-012-4557-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-012-4557-z

Keywords

Navigation