Linear Programming Fitting of Implicit Polynomials

  • Authors:
  • Zhibin Lei;David B. Cooper

  • Affiliations:
  • Lucent Technologies, Murray Hill, NJ;Brown Univ., Providence, RI

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1998

Quantified Score

Hi-index 0.14

Visualization

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 (LP) is used to do the fitting. The approach can incorporate a variety of distance measures and global geometric constraints.