Symbol Spotting Through Prototype-based Search

Chapter
First Online:

Abstract

In this chapter, we present a method to determine which symbols are probable to be found in technical drawings by the use of a prototype-based search. First, symbols are decomposed into primitives representing closed regions. These primitives are then encoded in terms of attributed strings. Second, the strings are organized in a lookup table so that the set median strings act as representative prototypes of the clusters of similar primitives. This indexing data structure aims at efficiently retrieving the locations from the document collection where similar primitives as the queried ones can be found. Finally, a voting scheme formulates hypotheses in the locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes.

Keywords

Lookup Table Adjacent Segment Vote Scheme String Match Table Entry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arkin, E., Chew, L., Huttenlocher, D., Kedem, K., Mitchell, J.: An efficiently computable metric for comparing polygonal shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(3), 209–216 (1991) CrossRefGoogle Scholar
  2. 2.
    Artac̆, M., Jogan, M., Leonardis, A.: Incremental PCA for on-line visual learning and recognition. In: Proceedings of the International Conference on Pattern Recognition, pp. 781–784. IEEE Computer Society, Los Alamitos (2002) Google Scholar
  3. 3.
    Bunke, H., Bühler, U.: Applications of approximate string matching to 2D shape recognition. Pattern Recognition 26(12), 1797–1812 (1993) CrossRefGoogle Scholar
  4. 4.
    Dori, D.: Vector-based arc segmentation in the machine drawing understanding system environment. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(11), 1057–1068 (1995) CrossRefGoogle Scholar
  5. 5.
    Fawcett, T.: An introduction to ROC analysis. Pattern Recognition Letters 27(8), 861–874 (2006) CrossRefMathSciNetGoogle Scholar
  6. 6.
    Kanungo, T., Haralick, R., Philips, I.: Global and local document degradation models. In: Proceedings of the Second International Conference on Document Analysis and Recognition, pp. 730–734. IEEE Computer Society, Los Alamitos (1993) Google Scholar
  7. 7.
    Kaygin, S., Bulut, M.: Shape recognition using attributed string matching with polygon vertices as the primitives. Pattern Recognition Letters 23(13), 287–294 (2002) MATHCrossRefGoogle Scholar
  8. 8.
    Latecki, L., Lakämper, R., Eckhardt, T.: Shape descriptors for non-rigid shapes with a single closed contour. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 424–429. IEEE Computer Society, Los Alamitos (2000) Google Scholar
  9. 9.
    Lorenz, O., Monagan, G.: A retrieval system for graphical documents. In: Proceedings of the Fourth Symposium on Document Analysis and Information Retrieval, pp. 291–300 (1995) Google Scholar
  10. 10.
    Maes, M.: Polygonal shape recognition using string-matching techniques. Pattern Recognition 24(5), 433–440 (1991) CrossRefGoogle Scholar
  11. 11.
    Pang, S., Ozawa, S., Kasabov, N.: Inremental linear discriminant analysis for classification of data streams. IEEE Transactions on Systems, Man and Cybernetics 35(5), 905–914 (2005) CrossRefGoogle Scholar
  12. 12.
    van Rijsbergen, C.: Information Retrieval. Butterworth-Heinemann Newton, MA, USA (1979) Google Scholar
  13. 13.
    Rosin, P., West, G.: Segmentation of edges into lines and arcs. Image and Vision Computing 7(2), 109–114 (1989) CrossRefGoogle Scholar
  14. 14.
    Sánchez, G., Lladós, J., Tombre, K.: A mean string algorithm to compute the average among a set of 2D shapes. Pattern Recognition Letters 23, 203–213 (2002) MATHCrossRefGoogle Scholar
  15. 15.
    Stein, F., Medioni, G.: Structural indexing: Efficient 2D object recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 14(12), 1198–1204 (1992) CrossRefGoogle Scholar
  16. 16.
    Stein, F., Medioni, G.: Structural indexing: Efficient 3D object recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 14(2), 125–145 (1992) CrossRefGoogle Scholar
  17. 17.
    Tănase, M., Veltkamp, R., Haverkort, H.: Multiple polyline to polygon matching. In: Algorithms and Computation, Lecture Notes on Computer Science, vol. 3872, pp. 60–70. Springer, Berlin (2005) CrossRefGoogle Scholar
  18. 18.
    Tsay, Y., Tsai, W.: Model-guided attributed string matching by split-and-merge for shape recognition. International Journal on Pattern Recognition and Artificial Intelligence 3(2), 159–179 (1989) CrossRefGoogle Scholar
  19. 19.
    Wagner, R., Fischer, M.: The string-to-string correction problem. Journal of the Association for Computing Machinery 21(1), 168–173 (1974) MATHMathSciNetGoogle Scholar
  20. 20.
    Wenyin, L., Dori, D.: Incremental arc segmentation algorithm and its evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(4), 424–431 (1998) CrossRefGoogle Scholar
  21. 21.
    Wolfson, H.: On curve matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5), 483–489 (1990) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2010

Authors and Affiliations

  1. 1.Departament de Ciències de la Computació, Centre de Visió per ComputadorUniversitat Autònoma de BarcelonaBellaterraSpain

Personalised recommendations