Data clustering for circle detection

Croatian Operational Research Review

Tomislav Marošević¹ 

[1] Josip Juraj Strossmayer University of Osijek, Osijek, Croatia;

关键词: data clustering;    circle detection;    k-means;    locally optimal partition;   

DOI  :  

来源: DOAJ

【 摘 要 】

This paper considers a multiple-circle detection problem on the basis of given data. The problem is solved by application of the center-based clustering method. For the purpose of searching for a locally optimal partition modeled on the well-known k-means algorithm, the k-closest circles algorithm has been constructed. The method has been illustrated by several numerical examples.

【 授权许可】

Unknown