Revision as of 09:44, 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 below.

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.

Alumni Liaison

Recent Math PhD now doing a post-doctorate at UC Riverside.

Kuei-Nuan Lin