A probabilistic approach to robust shape matching

Graham McNeill, S. Vijayakumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We present a probabilistic approach to shape matching that is invariant to rotation, translation and scaling. Shapes can be represented by unlabeled point sets, so discontinuous boundaries and non-boundary points do not pose a problem. Occlusion, significant dissimilarities between shapes and image clutter are explained by a background model, and hence, their impact on the overall match is limited. The ability to operate on incomplete shape representations and ignore part of the input means that, unlike many matching algorithms, our technique performs well on real images. We derive a continuous version of the model which can be used when the 'query shape' is more accurately described by a set of line segments-e.g. a boundary polygon or line drawing. The effectiveness of the algorithms is demonstrated using the benchmark MPEG-7 data set and real images
Original languageEnglish
Title of host publicationImage Processing, 2006 IEEE International Conference on
Number of pages4
ISBN (Electronic)1-4244-0481-9
Publication statusPublished - 2006


Dive into the research topics of 'A probabilistic approach to robust shape matching'. Together they form a unique fingerprint.

Cite this