A comparison of fuzzy shell-clustering methods for the detection of ellipses

In this paper, we introduce a shell-clustering algorithm for ellipsoidal clusters based on the so-called “radial distance” which can be easily extended to superquadric clusters. We compare our algorithm with other algorithms in the literature that are based on the algebraic distance, the approximate distance, the normalized radial distance, and the exact distance. We evaluate the performance of each algorithm on two-dimensional data sets containing “scattered” ellipses, partial ellipses, outliers, and ellipses of disparate sizes, and summarize the relative strengths and weaknesses of each algorithm