Approximation of n-dimensional data using spherical and ellipsoidal primitives

Authors:
G. Calafiore
Affiliations:
Dipt. di Automatica e Informatica, Politecnico di Torino
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2002

Citing 0
Cited 3

Incremental procedures for partitioning highly intermixed multi-class datasets into hyper-spherical and hyper-ellipsoidal clusters

Data & Knowledge Engineering
Fast and efficient colour inspection using sets of ellipsoidal regions

Machine Graphics & Vision International Journal
Robust Fitting of Circle Arcs

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the problem of approximating data points in n-dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spherical approximation, while an efficient, globally optimal solution for the ellipsoidal problem is proposed in terms of semidefinite programming. In addition, the paper presents a result for robust fitting in presence of outliers, and illustrates the theory with several numerical examples. A brief survey is also presented on the solutions to other relevant geometric approximation problems, such as ellipsoidal covering of convex hulls and pattern separation.