Abstract
This paper deals with the recognition of symbols and structural textures in architectural plans using string matching techniques. A plan is represented by an attributed graph whose nodes represent characteristic points and whose edges represent segments. Symbols and textures can be seen as a set of regions, i.e. closed loops in the graph, with a particular arrangement. The search for a symbol involves a graph matching between the regions of a model graph and the regions of the graph representing the document. Discriminating a texture means a clustering of neighbouring regions of this graph. Both procedures involve a similarity measure between graph regions. A string codification is used to represent the sequence of outlining edges of a region. Thus, the similarity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.
Preview
Unable to display preview. Download preview PDF.
References
D. Antoine, S. Collin, and K. Tombre. Analysis of technical documents: The redraw system. In H.S. Baird, H. Bunke, and K. Yamamoto, editors, Structured document image analysis, pages 385–402. Springer Verlag, 1992.
F. Aurenhammer. Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Comput. Surveys, 23(3):345–405, 1991.
L. Boatto et al. An interpretation system for land register maps. Computer, 25(7):25–33, July 1992.
H. Bunke and U. Buhler. Applications of approximate string matching to 2d shape recognition. Pattern Recognition, 26(12):1797–1812, 1993.
H. Bunke and B.T. Messmer. Efficient attributed graph matching and its application to image analysis. In C. Braccini, L. DeFloriani, and G. Vernazza, editors, Proc. of 8th ICIAP, San Remo, Italy, pages 45–55. Volume 974 of LNCS, Aug 1995.
A.H. Habacha. Structural recognition of disturbed symbols using discrete relaxation. In 1st. ICDAR, pages 170–178, Sep-Oct 1991. Saint Malo, France.
X.Y. Jiang and H. Bunke. An optimal algorithm for extracting the regions of a plane graph. Pattern Recognition Letters, (14):553–558, 1993.
R. Kasturi, S.T. Bow, W. El-Masri, J. Shah, Gattiker J.R., and Mokate U.B. A system for interpretation of line drawings. IEEE Trans on PAMI, 12(10):978–992, Oct 1990.
P. Kuner and B. Ueberreiter. Pattern recognition by graph matching. Combinatorial versus continuous optimization. IJPRAI, 2(3):527–542, Sep 1988.
Stephen W.C. Lam and Horace H.S. Ip. Structural texture segmentation using irregular pyramid. Pattern Recognition Letters, pages 691–698, July 1994.
S.W. Lee, J.H. Kim, and F.C.A. Groen. Translation-, rotation-, and scale-invariant recognition of hand-drawn symbols in schematic diagrams. IJPRAI, 4(1):1–25, 1990.
M. Maes. Polygonal shape recognition using string-matching techniques. Pattern Recognition, 24(5):433–440, 1991.
W.H. Tsai and S.S. Yu. Attributed string matching with merging for shape recognition. In 7th. ICPR, pages 1162–1164, 1984. Montreal, Canada.
Y.T. Tsay and W.H. dTsai. Model-guided attributed string matching by split-andmerge for shape recognition. IJPRAI, 3(2):159–179, 1989.
R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168–173, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lladós, J., Sánchez, G., Martí, E. (1998). A string based method to recognize symbols and structural textures in architectural plans. In: Tombre, K., Chhabra, A.K. (eds) Graphics Recognition Algorithms and Systems. GREC 1997. Lecture Notes in Computer Science, vol 1389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64381-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-64381-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64381-4
Online ISBN: 978-3-540-69766-4
eBook Packages: Springer Book Archive