Published October 5, 2013 | Version v1

Fitting Quadratic Curves to Data Points

  • 1. Department of Mathematics, University of Alabama at Birmingham, Birmingham, AL 35294, USA.
  • 2. Department of Mathematics, Black Hills State University, Spearfish, SD 57799, USA.

Description

Fitting quadratic curves (a.k.a. conic sections, or conics) to data points (digitized images) is a
fundamental task in image processing and computer vision. This problem reduces to minimization
of a certain function over the parameter space of conics. Here we undertake a thorough
investigation of that space and the properties of the objective function on it. We determine under
what conditions that function is continuous and differentiable. We identify its discontinuities and
other singularities and determined what effect those have on the performance of minimization
algorithms. Our analysis shows that algebraic parameters of conics are more suitable for
minimization procedures than more popular geometric parameters, for a number of reasons. First,
the space of parameters is naturally compact, thus their estimated values cannot grow indefinitely
causing divergence. Second, with algebraic parameters minimization procedures can move freely
and smoothly between conics of different types allowing shortcuts and faster convergence. Third,
with algebraic parameters one avoids known issues occurring when the fitting conic becomes a
circle. To support our conclusions we prove a dozen of mathematical theorems and provide a
plenty of illustrations.

Files

Chernov_2013_BJMCS_6016.pdf

Files (570.7 kB)

Name Size
md5:592923c000bfeb2e99ea7a3e7056e9ec
570.7 kB Preview Download