Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Multiple ellipse fitting by center-based clustering (CROSBI ID 219005)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Marošević, Tomislav ; Scitovski, Rudolf Multiple ellipse fitting by center-based clustering // Croatian operational research review, 6 (2015), 1; 43-53

Podaci o odgovornosti

Marošević, Tomislav ; Scitovski, Rudolf

engleski

Multiple ellipse fitting by center-based clustering

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.

multiple ellipse fitting; center-based clustering; algebraic criterion; Mahalanobis distance

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

6 (1)

2015.

43-53

objavljeno

1848-0225

1848-9931

Povezanost rada

Matematika

Indeksiranost