Detecting circles and ellipses in images is the first step of many computer vision applications including industrial robotic operations and autonomous navigation. To this end, point sequences constituting elliptic arcs are detected by image processing operations, and then an ellipse equation is fitted to them. In the past, many methods have been proposed for ellipse fitting [1], [3], [4]. Howev...

Suppose that N inputs to a linear, time-invariant channel are designed to maximize the minimum L , distance between channel outputs. It is assumed that all inputs are zero outside the finite time window [ T , TI and are constrained in energy. The jointly optimal inputs and channel frequency response H(f) for which the minimum distance is maximized is studied, subject to the constraint that the ...

Computer vision algorithms have historically been difficult to deploy in resource-constrained embedded systems. Ellipse detection or fitting is an important subproblem in computer vision, and these algorithms are computationally complex enough to pose significant design challenges when targeting an embedded system problem domain. This work describes a least squares ellipse fitting system target...

A k-ellipse is a plane curve consisting of all points whose distances from k fixed foci sum to constant. We determine the singularities and genus its Zariski closure in complex projective plane. The paper resolves an open problem stated by Nie, Parrilo Sturmfels 2008.