کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
528985 | 869622 | 2011 | 11 صفحه PDF | دانلود رایگان |

We present a novel approach to the problem of establishing the best match between an open contour and a part of a closed contour. At the heart of the proposed scheme lies a novel shape descriptor that also permits the quantification of local scale. Shape descriptors are computed along open or closed contours in a spatially non-uniform manner. The resulting ordered collections of shape descriptors constitute the global shape representation. A variant of an existing Dynamic Time Warping (DTW) matching technique is proposed to handle the matching of shape representations. Due to the properties of the employed shape descriptor, sampling scheme and matching procedure, the proposed approach performs partial shape matching that is invariant to Euclidean transformations, starting point as well as to considerable shape deformations. Additionally, the problem of matching closed-to-closed contours is naturally treated as a special case. Extensive experiments on benchmark datasets but also in the context of specific applications, demonstrate that the proposed scheme outperforms existing methods for the problem of partial shape matching and performs comparably to methods for full shape matching.
Graphical AbstractFigure optionsDownload high-quality image (127 K)Download as PowerPoint slideResearch Highlights
► A method for matching and alignment of an open contour to a part of a closed contour.
► A local, 2D shape descriptor that Is tolerant to articulations and deformations.
► Non-uniform sampling of a contour that decides where descriptors should be computed.
► A variant of a dynamic programming-based technique for partial shape matching.
► The matching of closed contours is treated as a special case.
Journal: Image and Vision Computing - Volume 29, Issue 7, June 2011, Pages 459–469