hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2015.0004

Multiple ellipse fitting by center-based clustering

Tomislav Marošević ; Department of Mathematics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia
Rudolf Scitovski ; Department of Mathematics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia

Puni tekst: engleski, pdf (591 KB) str. 43-53 preuzimanja: 792* citiraj
APA 6th Edition
Marošević, T. i Scitovski, R. (2015). Multiple ellipse fitting by center-based clustering. Croatian Operational Research Review, 6 (1), 43-53. https://doi.org/10.17535/crorr.2015.0004
MLA 8th Edition
Marošević, Tomislav i Rudolf Scitovski. "Multiple ellipse fitting by center-based clustering." Croatian Operational Research Review, vol. 6, br. 1, 2015, str. 43-53. https://doi.org/10.17535/crorr.2015.0004. Citirano 19.06.2019.
Chicago 17th Edition
Marošević, Tomislav i Rudolf Scitovski. "Multiple ellipse fitting by center-based clustering." Croatian Operational Research Review 6, br. 1 (2015): 43-53. https://doi.org/10.17535/crorr.2015.0004
Harvard
Marošević, T., i Scitovski, R. (2015). 'Multiple ellipse fitting by center-based clustering', Croatian Operational Research Review, 6(1), str. 43-53. doi: https://doi.org/10.17535/crorr.2015.0004
Vancouver
Marošević T, Scitovski R. Multiple ellipse fitting by center-based clustering. Croatian Operational Research Review [Internet]. 2015 [pristupljeno 19.06.2019.];6(1):43-53. doi: https://doi.org/10.17535/crorr.2015.0004
IEEE
T. Marošević i R. Scitovski, "Multiple ellipse fitting by center-based clustering", Croatian Operational Research Review, vol.6, br. 1, str. 43-53, 2015. [Online]. doi: https://doi.org/10.17535/crorr.2015.0004

Sažetak
This paper deals with the multiple ellipse fitting problem based on a given set of data points in a plane. The presumption is that all data points are derived from k ellipses that should be fitted. The problem is solved by means of center-based clustering, where cluster centers are ellipses. If the Mahalanobis distance-like function is introduced in each cluster, then the cluster center is represented by the corresponding Mahalanobis circle-center. The distance from a point a∈R^2 to the Mahalanobis circle is based on the algebraic criterion. The well-known k-means algorithm has been adapted to search for a locally optimal partition of the Mahalanobis circle-centers. Several numerical examples are used to illustrate the proposed algorithm.

Ključne riječi
multiple ellipse fitting; center-based clustering; algebraic criterion; Mahalanobis distance

Hrčak ID: 138572

URI
https://hrcak.srce.hr/138572

Posjeta: 987 *