engleski

A combination of k-means and DBSCAN algorithm for solving the multiple generalized circle detection problem

Motivated by the problem of identifying rod- shaped particles (e.g. bacilliform bacterium), in this paper we consider the multiple generalized circle detection problem. We propose a method for solving this problem that is based on center-based clustering, where cluster-centers are generalized circles. An efficient algorithm is proposed which is based on a modification of the well-known k- means algorithm for generalized circles as cluster- centers. In doing so, it is extremely important to have a good initial approximation. For the purpose of recognizing detected generalized circles, a QAD-indicator is proposed. Also a new DBC-index is proposed, which is specialized for such situations. The recognition process is intitiated by searching for a good initial partition using the DBSCAN-algorithm. If QAD- indicator shows that generalized circle- cluster-center does not recognize searched generalized circle for some cluster, the procedure continues searching for corresponding initial generalized circles for these clusters using the Incremental algorithm. After that, corresponding generalized circle-cluster- centers are calculated for obtained clusters. This will happen if a data point set stems from intersected or touching generalized circles. The method is illustrated and tested on different artificial data sets coming from a number of generalized circles and real images.

Multiple generalized circles, The detection problem, Modified k-means, DBSCAN, Incremental algorithm

nije evidentirano