Boundary Shape Recognition Using Accumulated Length and Angle Information

  • Marçal Rusiñol
  • Philippe Dosch
  • Josep Lladós
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4478)


In this paper we present a method to recognize shapes by analyzing a polygonal approximation of their boundaries. The method is independent of the used approximation method since its recognition strategy does not rely on the number of segments composing the shape. Length and turning angle information are extracted from the chain of segments. The comparison method is invariant to scale, translation and some occlusions of the extracted contour. A simple pre-processing method, also based on arc-length features, is presented to be used as a coarse fitting method to determine angle rotation and as a first filter to eliminate non pertinent candidates.


Dynamic Time Warping Content Base Image Retrieval Zernike Moment Turning Angle Normalize Cross Correlation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Latecki, L.J., Lakamper, R., Eckhardt, T.: Shape descriptors for non-rigid shapes with a single closed contour. IEEE Conference on Computer Vision and Pattern Recognition, Proceedings 1, 424–429 (2000)Google Scholar
  2. 2.
    Nishida, H.: Structural feature indexing for retrieval of partially visible shapes. Pattern Recognition 35(1), 55–67 (2002)zbMATHCrossRefGoogle Scholar
  3. 3.
    Rosin, P.L., West, G.A.: Segmentation of Edges into Lines and Arcs. Image and Vision Computing 7(2), 109–114 (1989)CrossRefGoogle Scholar
  4. 4.
    Sankoff, D., Kruskal, J.B.: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, London (1983)Google Scholar
  5. 5.
    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
  6. 6.
    Tombre, K., Ah-Soon, C., Dosch, P., Masini, G., Tabbone, S.: Stable and Robust Vectorization: How to Make the Right Choices. In: Chhabra, A.K., Dori, D. (eds.) GREC 1999. LNCS, vol. 1941, pp. 3–18. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Wall, K., Danielsson, P.E.: A fast sequential method for polygonal approximation of digitized curves. Computer Vision, Graphics, and Image Processing 28(2), 220–227 (1984)CrossRefGoogle Scholar
  8. 8.
    Wolfson, H.J.: On curve matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5), 483–489 (1990)CrossRefGoogle Scholar
  9. 9.
    Zhang, D., Lu, G.: Review of shape representation and description techniques. Pattern recognition 37(1), 1–19 (2004)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Marçal Rusiñol
    • 1
  • Philippe Dosch
    • 2
  • Josep Lladós
    • 1
  1. 1.Computer Vision Center, Dept. Ciències de la Computació, Edifici O, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona)Spain
  2. 2.Loria UMR 7503, 615, rue du jardin botanique, B.P. 101, 54602, Villers-lès-Nancy CedexFrance

Personalised recommendations