Abstract
We present a 2D shape recognition and classification method based on matching shape outlines. The correspondence between outlines (curves) is based on a notion of an alignment curve and on a measure of similarity between the intrinsic properties of the curve, namely, length and curvature, and is found by an efficient dynamic-programming method. The correspondence is used to find a similarity measure which is used in a recognition system. We explore the strengths and weaknesses of the outline-based representation by examining the effectiveness of the recognition system on a variety of examples.
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
N. Ayache and O. Faugeras. HYPER: A new approach for the recognition and positioning of two-dimensional objects. PAMI, 8(1):44–54, January 1986.
R. Basri, L. Costa, D. Geiger, and D. Jacobs. Determining the similarity of deformable shapes. Vision Research, 38:2365–2385, 1998.
S. Belongie and J. Malik. Matching with shape contexts. CBAIVL, 2000.
I. Cohen, N. Ayache, and P. Sulger. Tracking points on deformable objects using curvature information. ECCV, pages 458–466, 1992.
S. Connell and A. Jain. Learning prototypes for on-line handwritten digits. ICPR, page PRP1, August 1998.
Y. Gdalyahu and D. Weinshall. Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes. PAMI, 21(12):1312–1328, December 1999.
S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. PAMI, 18(4):377–388, 1996.
M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. IJCV, 1:321–331, 1988.
P. Klein, T. Sebastian, and B. Kimia. Shape matching using edit-distance: an implementation. SODA, pages 781–790, 2001.
P. Klein, S. Tirthapura, D. Sharvit, and B. Kimia. A tree-edit distance algorithm for comparing simple, closed shapes. SODA, pages 696–704, 2000.
H. Liu and M. Srinath. Partial shape classification using contour matching in distance transformation. PAMI, 12(11):1072–1079, November 1990.
T. Liu and D. Geiger. Approximate tree matching and shape similarity. ICCV, pages 456–462, September 1999.
E. Milios and E. Petrakis. Shape retrieval based on dynamic programming. Trans. Image Proc., 9(1):141–146, 2000.
M. Pelillo, K. Siddiqi, and S. Zucker. Matching hierarchical structures using association graphs. PAMI, 21(11):1105–1120, November 1999.
J. Schwartz and M. Sharir. Identification of partially obscured objects in two and three dimensions by matching noisy characteristic curves. Intl. J. Rob. Res., 6(2):29–44, 1987.
T. Sebastian, P. Klein, and B. Kimia. Curve matching using alignment curve. Technical Report LEMS 184, LEMS, Brown University, June 2000.
D. Sharvit, J. Chan, H. Tek, and B. B. Kimia. Symmetry-based indexing of image databases. JVCIR, 9(4):366–380, December 1998.
K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. IJCV, 35(1):13–32, November 1999.
H. Tagare, D. O’Shea, and A. Rangarajan. A geometric correspondence for shape-based non-rigid correspondence. ICCV, pages 434–439, 1995.
S. Umeyama. Parameterized point pattern matching and its application to recognition of object families. PAMI, 15(2):136–144, February 1993.
H. Wolfson. On curve matching. PAMI, 12(5):483–489, May 1990.
L. Younes. Computable elastic distance between shapes. SIAM J. Appl. Math., 58:565–586, 1998.
S. C. Zhu and A. L. Yuille. FORMS: A flexible object recognition and modeling system. IJCV, 20(3), 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sebastian, T.B., Klein, P.N., Kimia, B.B. (2001). Alignment-Based Recognition of Shape Outlines. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form 2001. IWVF 2001. Lecture Notes in Computer Science, vol 2059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45129-3_56
Download citation
DOI: https://doi.org/10.1007/3-540-45129-3_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42120-7
Online ISBN: 978-3-540-45129-7
eBook Packages: Springer Book Archive