Thumbnail
Access Restriction
Subscribed

Author Chatterjee, C. ♦ Chong, E.K.P.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Other branches of engineering
Subject Keyword Layout ♦ Ellipsoids ♦ Manufacturing ♦ Data mining ♦ Gaussian processes ♦ Noise shaping ♦ Shape measurement ♦ Data engineering ♦ Application software ♦ Iterative methods
Abstract We present an efficient algorithm for finding the center of conics and quadrics of known parameters in noisy or scarce data. The problem arises in applications where a conic or quadric of known parameters, such as a circle of known radius, is extracted from a scene or part. Although the original problem is nonlinear and usually requires an iterative method for its solution, we reduce it to the well-known problem of minimizing a nonhomogeneous quadratic expression on the unit sphere. In the case of closed conics and quadrics, such as circles, ellipses, spheres, and ellipsoids, we obtain the solution in just one iteration, and no starting estimate is required. For hyperbolas and hyperboloids, we describe the Gauss Seidel algorithm, for which we give a Lyapunov type proof of convergence. Furthermore, every iteration of this algorithm satisfies all constraints.
Description Author affiliation: Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA (Chatterjee, C.)
ISBN 0780335902
ISSN 01912216
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-12-13
Publisher Place Japan
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 210.91 kB
Page Count 2
Starting Page 3735
Ending Page 3736


Source: IEEE Xplore Digital Library