Data clustering for circle detection
Abstract
This paper considers multiple-circle detection problem on the basis of given data. The problem is being solved by application of center-based clustering method. For the purpose of searching a locally optimal partition, modeled on a well-known k-means algorithm, k-closest circles algorithm has been constructed. The method has been illustrated with several numerical examples.
Key words: data clustering, circle detection, k-means, locally optimal partition
Downloads
Additional Files
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
