Title :
Linear programming fitting of implicit polynomials
Author :
Lei, Zhibin ; Cooper, David B.
Author_Institution :
Lucent Technol., Murray Hill, NJ, USA
fDate :
2/1/1998 12:00:00 AM
Abstract :
A new implicit polynomial (IP) fitting method is presented. It provides a different way of viewing the IP fitting problem from those of the nonlinear optimization approaches. It requires less computation, and can be done automatically or interactively. Linear programming is used to do the fitting. The approach can incorporate a variety of distance measures and global geometric constraints
Keywords :
approximation theory; computational geometry; curve fitting; image representation; linear programming; polynomials; distance approximation; fitting algorithm; geometric constraints; implicit polynomial; linear programming; shape representation; Approximation algorithms; Curve fitting; Error correction; Linear approximation; Linear programming; Object recognition; Polynomials; Shape; User interfaces; Vectors;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
