Izvorni znanstveni članak

https://doi.org/10.21857/yvjrdcqq8y

A fast and efficient method for solving the multiple line detection problem

Rudolf Scitovski orcid.org/0000-0002-7386-5991 ; Department of Mathematics, University of Osijek, 31 000 Osijek, Croatia
Una Radojičić ; Department of Mathematics, University of Osijek, 31 000 Osijek, Croatia
Kristian Sabo ; Department of Mathematics, University of Osijek, 31 000 Osijek, Croatia

Sažetak

In this paper, we consider the multiple line detection problem on the basis of a data points set coming from a number of lines not known in advance. A new and efficient method is proposed, which is based upon center-based clustering, and it solves this problem quickly and precisely. The method has been tested on 100 randomly generated data sets. In comparison to the incremental algorithm, the method gives significantly better results. Also, in order to identify a partition with the most appropriate number of clusters, a new index has been proposed for the case of a cluster whose lines are cluster-centers. The index can also be generalized for other geometrical objects.

Ključne riječi

Location; multiple line detection problem; center-based clustering; number of clusters; globally optimal partition.

Hrčak ID:

225233

URI

https://hrcak.srce.hr/225233

Datum izdavanja:

17.9.2019.

Posjeta: 1.371 *