Year: 2006
Type: other
Abstract: We present a probabilistic approach to shape matching which is invariant to rotation, translation and scaling. Shapes are represented by unlabeled point sets, so discontinuous boundaries and non-boundary points do not pose a problem. Occlusions, significant dissimilarities between shapes and image clutter are explained by a ‘background model’ and hence, their impact on the overall match is limited. By simultaneously learning a part decomposition of both shapes, we are able to successfully match shapes that differ as a result of independent part transformations – a form of variation common amongst real objects of the same class. The effectiveness of the matching algorithm is demonstrated using the benchmark MPEG-7 data set and real images.
Source: ERA
Authors: Graham McNeill, Sethu Vijayakumar
Institution: University of Edinburgh
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W9877987
