By Topic

Linear programming fitting of implicit polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhibin Lei ; Lucent Technol., Murray Hill, NJ, USA ; D. B. Cooper

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

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:20 ,  Issue: 2 )