Sciweavers

Share
CVPR
2011
IEEE

2D Nonrigid Partial Shape Matching Using MCMC and Contour Subdivision

8 years 2 months ago
2D Nonrigid Partial Shape Matching Using MCMC and Contour Subdivision
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D closed contours and matching two shape contours can usually be formulated as finding a one-to-one dense point correspondence between them. However, in practice, many shape contours are extracted from real images and may contain partial occlusions. This leads to the challenging partial shape matching problem, where we need to identify and match a subset of segments of the two shape contours. In this paper, we propose a new MCMC (Markov chain Monte Carlo) based algorithm to handle partial shape matching with mildly non-rigid deformations. Specifically, we represent each shape contour by a set of ordered landmark points. The selection of a subset of these landmark points into the shape matching is evaluated and updated by a posterior distribution, which is composed of both a matching likelihood and a prior dis...
Y. Cao, Z. Zhang, I. Czogiel, I. Dryden, S. Wang
Added 12 Apr 2011
Updated 29 Apr 2011
Type Conference
Year 2011
Where CVPR
Authors Y. Cao, Z. Zhang, I. Czogiel, I. Dryden, S. Wang
Comments (0)
books