Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Cohen, I., Herlen, I.: Curves matching using geodesic paths. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 741–46 (1998)
Cootes, T.F., Taylor, C.J.: Statistical models of appearance for medical image analysis and computer vision. SPIE Medical Imagin (2001)
Directed acyclic graph, http://mathworld.wolfram.com/AcyclicDigraph.html
Debled, I., Reveilles, J.P.: A linear algorithm for segmentation of digital curves. In: Third International Workshop on Parallel image analysis (1994)
Feschet, F., Tougne, L.: On the min dss problem of the closed discrete curves. Discrete Applied Mathematics (accepted for publication, 2005)
Mokhtarian, F., abbasi, S., Kittler, J.: Robust and Efficient shape indexing through Curvature Scale Space. BMVC 1, 53–62 (1996)
Rennesson, I.D., Remy, J.L., Rouyer, J.: Segmentation of discrete curves into fuzzy segments. In: IWCIA, vol. 12 (2003)
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)
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)
Tougne, L.: Descriptions robustes de formes en géométrie discrète. Habilitation à diriger des recherches de l’université Lyon 2 (December 2004)
Wolfson, H.J.: On curve matching. Transactions on pattern analysis and machine intelligence 12, 483–489 (1990)
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)
Younes, L.: Computable elastic distance between shapes. SIAM Journal on Applied Mathematics 58, 565–586 (1998)
Zhu, S.S., Yuille, A.L.: Forms: A flexible object recognition and momdeling system. International Journal of Computer Vision 20, 187–212 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boukhriss, I., Miguet, S., Tougne, L. (2006). Two-Dimensional Discrete Shape Matching and Recognition. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_35
Download citation
DOI: https://doi.org/10.1007/11774938_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35153-5
Online ISBN: 978-3-540-35154-2
eBook Packages: Computer ScienceComputer Science (R0)