Izvorni znanstveni članak

Data clustering for circle detection

Tomislav Marošević ; Department of Mathematics

Sažetak

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.

Ključne riječi

data clustering; circle detection; k-means; locally optimal partition

Hrčak ID:

120189

URI

https://hrcak.srce.hr/120189

Datum izdavanja:

31.3.2014.

Posjeta: 2.335 *