(New page: ==A Solution Method For Zero-Dimensional Polynomial Equation System==) |
|||
| Line 1: | Line 1: | ||
==A Solution Method For Zero-Dimensional Polynomial Equation System== | ==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. | ||
Revision as of 10:44, 21 April 2010
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.
