Data clustering for circle detection

Tomislav Marošević · Croatian Operational Research Review · 2014

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.

Read the paper · More papers on PaperTik