Revision as of 17:50, 21 April 2010 by Huang94 (Talk | contribs)

A Solution Method For Zero-Dimensional Polynomial Equation System

Motivation

Consider the problem of curve registration, that is, finding the rotation and translation that best maps (i.e., registers) a cloud of points onto a template object, as described on the right.

We begin by approximating the curve defined by the contour of the template object by an implicit polynomial equation. This yields a bivariate polynomial equation p(x,y) = 0 whose solution set approximates the template contour.

Butterfly model.jpg

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood