Referenced Items are not available for this document.
Improvement of graph matching by a start condition parser is discussed, which arranges the dynamic lists into a hierarchical tree structure, using general topological criteria. The reference graphs of the symbols are generated by another parser, which interprets a model description language. Applications are in the processing of technical drawings. For example, in a circuit diagram, component symbols would be recognised and treated separately from connecting lines. The performance gain over known algorithms exceeds a factor of about ten in experimental results
Published in:
Pattern Recognition, 1988., 9th International Conference on
Date of Conference: 14-17 Nov 1988
- Page(s):
- 678 - 680 vol.2
- Meeting Date :
- 14 Nov 1988-17 Nov 1988
- Print ISBN:
- 0-8186-0878-1
- INSPEC Accession Number:
- 3351310
- Conference Location :
- Rome
- Digital Object Identifier :
- 10.1109/ICPR.1988.28326
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
