The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm

Scitovski, Rudolf, and Sabo, Kristian. "The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm." Applications of Mathematics 64.6 (2019): 663-678. <http://eudml.org/doc/294628>.

@article{Scitovski2019,
abstract = {We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse $E$ is viewed as a Mahalanobis circle with center $S$, radius $r$, and some positive definite matrix $\Sigma $. A very efficient method for solving this problem is proposed. The method uses a modification of the $k$-means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers are determined by means of a smaller number of iterations of the DIRECT global optimization algorithm. Unlike other methods known from the literature, our method recognizes well not only ellipses with clear edges, but also ellipses with noisy edges. CPU-time necessary for running the corresponding algorithm is very short and this raises hope that, with appropriate software optimization, the algorithm could be run in real time. The method is illustrated and tested on 100 randomly generated data sets.},
author = {Scitovski, Rudolf, Sabo, Kristian},
journal = {Applications of Mathematics},
keywords = {multiple ellipses detection problem; globally optimal $k$-partition; Lipschitz continuous function; DIRECT; $k$-means},
language = {eng},
number = {6},
pages = {663-678},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm},
url = {http://eudml.org/doc/294628},
volume = {64},
year = {2019},
}

TY - JOUR
AU - Scitovski, Rudolf
AU - Sabo, Kristian
TI - The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm
JO - Applications of Mathematics
PY - 2019
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 64
IS - 6
SP - 663
EP - 678
AB - We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse $E$ is viewed as a Mahalanobis circle with center $S$, radius $r$, and some positive definite matrix $\Sigma $. A very efficient method for solving this problem is proposed. The method uses a modification of the $k$-means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers are determined by means of a smaller number of iterations of the DIRECT global optimization algorithm. Unlike other methods known from the literature, our method recognizes well not only ellipses with clear edges, but also ellipses with noisy edges. CPU-time necessary for running the corresponding algorithm is very short and this raises hope that, with appropriate software optimization, the algorithm could be run in real time. The method is illustrated and tested on 100 randomly generated data sets.
LA - eng
KW - multiple ellipses detection problem; globally optimal $k$-partition; Lipschitz continuous function; DIRECT; $k$-means
UR - http://eudml.org/doc/294628
ER -