The Community for Technology Leaders
Green Image
Issue No. 01 - January (2009 vol. 31)
ISSN: 0162-8828
pp: 180-186
Chunjing Xu , The Chinese University of Hong Kong, Hong Kong
Jianzhuang Liu , The Chinese University of Hong Kong, Hong Kong
Xiaoou Tang , The Chinese University of Hong Kong, Hong Kong
In computer vision, shape matching is a challenging problem, especially when articulation and deformation of parts occur. These variations may be insignificant in terms of human recognition, but often cause a matching algorithm to give results that are inconsistent with our perception. In this paper, we propose a novel shape descriptor of planar contours, called contour flexibility, which represents the deformable potential at each point along a contour. With this descriptor, The local and global features can be obtained from the contour. We then present a shape matching scheme based on the features obtained. Experiments with comparisons to recently published algorithms show that our algorithm performs best.
2D shape, contour flexibility, matching

C. Xu, J. Liu and X. Tang, "2D Shape Matching by Contour Flexibility," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 31, no. , pp. 180-186, 2008.
93 ms
(Ver 3.3 (11022016))