PIMs and Invariant Parts for Shape Recognition

Z. Lei, T. Tasdizen, and David B. Cooper

Abstract

We present completely new very powerful solutions to two fundamental problems central to computer vision. 1. Given data sets representing C objects to be stored in a database and given a new data set for an object, determine the object in the database that is most like the object measured. We solve this problem through use of PIMs ("Polynomial Interpolated Measures"), which is a new representation integrating implicit polynomial curves and surfaces, explicit polynomials, and discrete data sets which may be sparse. The method provides high accuracy at low computational cost. 2. Given noisy 2D data along a curve (or 3D data along a surface), decompose the data into patches such that new data taken along affine transformations or Euclidean transformations of the curve (or surface) can be decomposed into corresponding patches. Then recognition of complex or partially occluded objects can be done in terms of invariantly determined patches. We briefly outline a low computational cost image-database indexing-system based on this representation for objects having complex shape-geometry.

Reference

@INPROCEEDINGS{Lei:1997:PIM,
  author =       {Z. Lei and T. Tasdizen and D.B. Cooper},
  title =        {PIMs and Invariant Parts for Shape Recognition},
  booktitle     = {Proceedings of Sixth International Conference on Computer Vision (ICCV'98)},  
  year          = {1998},
  address       = {Mumbai, India},
  date          = {January 4-7},
  pages =        {827--832},
  note          = {also as LEMS Tech. Report 163, Brown University}
}

Compressed postscript file of the article (165 Kb)