Skip to main content
Article thumbnail
Location of Repository

Representing and Comparing Shapes Using Shape Polynomials

By Gabriel Taubin, Ruud M. Bolle and David B. Cooper

Abstract

We address the problem of multiresolution 2D and 3D shape representation. Shape is defined as a probability measure with compact support. Both object representations, typically sets of curves and/or surface patches, and observations, sets of scattered data, can be represented in this way. Global properties of shapes are defined as expectations (statistical averages) of certain functions. In particular, the moments of the shapes are global properties. For any shape Ë � and every integer � � � we associate a shape polynomial of degree � � whose coefficients are functions of the moments of Ë. These polynomials are related to the shape Ë in an affine invariant way. They yield small values near Ë and large values far away and their level sets approximate Ë. With the shape polynomials we define two distances between shapes. An asymmetric distance measures how well one shape fits as a subset of another one; a symmetric version indicates how equal two shapes are. The evaluation of these distance measures is determined via a sequence of computationally very fast matrix operations. The distance measures are used for recognition and positioning of objects in occluded environments

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5863
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://mesh.brown.edu/taubin/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.