Two-Dimensional Discrete Shape Matching and Recognition

  • Isameddine Boukhriss
  • Serge Miguet
  • Laure Tougne
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4040)


We present a 2D matching method based on corresponding shape outlines. By working in discrete space, our study is done by using discrete operators and avoids interpolations and approximations. To encode shapes, we polygonalize their contours and we proceed by the extraction of intrinsic properties namely length, curvature and normal vectors. We optimize then a measure of similarity controlled by weight parameters over a dynamic programming process. The approach is not sensitive to sampling errors and affine transformations. We validate our approach on simple and complex forms, we made tests also to recognize shapes. The weight parameters could be interactively modified by an end-user to customize the matching.


Direct Acyclic Graph Shape Match Geodesic Path Curvature Scale Space Elastic Distance 
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. [AG03]
    Avants, B., Gee, J.: Matching with Scale-Space Curvature and Extrema-Based Scale Selection. In: Griffin, L.D., Lillholm, M. (eds.) Scale-Space 2003. LNCS, vol. 2695, pp. 798–813. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. [CH98]
    Cohen, I., Herlen, I.: Curves matching using geodesic paths. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 741–46 (1998)Google Scholar
  3. [CT01]
    Cootes, T.F., Taylor, C.J.: Statistical models of appearance for medical image analysis and computer vision. SPIE Medical Imagin (2001)Google Scholar
  4. [DAG]
  5. [DR94]
    Debled, I., Reveilles, J.P.: A linear algorithm for segmentation of digital curves. In: Third International Workshop on Parallel image analysis (1994)Google Scholar
  6. [FT05]
    Feschet, F., Tougne, L.: On the min dss problem of the closed discrete curves. Discrete Applied Mathematics (accepted for publication, 2005)Google Scholar
  7. [MaK96]
    Mokhtarian, F., abbasi, S., Kittler, J.: Robust and Efficient shape indexing through Curvature Scale Space. BMVC 1, 53–62 (1996)Google Scholar
  8. [RRR03]
    Rennesson, I.D., Remy, J.L., Rouyer, J.: Segmentation of discrete curves into fuzzy segments. In: IWCIA, vol. 12 (2003)Google Scholar
  9. [SKKC00]
    Sebastian, B., Klein, P.N., Kimia, B.B., Crisco, J.J.: Constructing 2D Curve Atlases Thomas. In: IEEE Workshop on Mathematical Methods in Biomedical Image Analysis, pp. 70–77 (2000)Google Scholar
  10. [SS87]
    Schwartz, J.T., Sharir, M.: Identification of partially obscured objects in two dimensions by matching of noisy characteristics curves. International Journal of Robotics Research 6, 29–44 (1987)CrossRefGoogle Scholar
  11. [Tou04]
    Tougne, L.: Descriptions robustes de formes en géométrie discrète. Habilitation à diriger des recherches de l’université Lyon 2 (December 2004)Google Scholar
  12. [Wol90]
    Wolfson, H.J.: On curve matching. Transactions on pattern analysis and machine intelligence 12, 483–489 (1990)CrossRefGoogle Scholar
  13. [WT04]
    Wang, Y., Teoh, E.K.: A novel 2d shape matching algorithm based on B-Spline Modeling. In: International Conference on Image Processing, pp. 409–412 (2004)Google Scholar
  14. [You98]
    Younes, L.: Computable elastic distance between shapes. SIAM Journal on Applied Mathematics 58, 565–586 (1998)MATHCrossRefMathSciNetGoogle Scholar
  15. [ZY96]
    Zhu, S.S., Yuille, A.L.: Forms: A flexible object recognition and momdeling system. International Journal of Computer Vision 20, 187–212 (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Isameddine Boukhriss
    • 1
  • Serge Miguet
    • 1
  • Laure Tougne
    • 1
  1. 1.Laboratoire LIRIS, Bâtiment EuropeUniversité Lyon 2BronFrance

Personalised recommendations