A Fast and Efficient Method for Solving the Multiple Closed Curve Detection Problem

Una Radojičić, Rudolf Scitovski, Kristian Sabo

2019

Abstract

The paper deals with the multiple closed curve detection problem, i.e. the multiple circle and the multiple ellipse detection problem are especially considered. Based on data coming from a number of closed curves not known in advance, it is necessary to recognize these curves. The approach we propose is based on center-based clustering, which means that the problem is reduced to searching for an optimal partition whose cluster-centers are the closed curves we searched for. By using a modified well-known k-means algorithm with carefully chosen initial approximation we shall look for these curves. For detecting the most appropriate number of clusters (closed curves), we have also proposed a new, specialized index that was significantly better than other well-known indexes.

Paper Citation

in Harvard Style

Radojičić U., Scitovski R. and Sabo K. (2019). A Fast and Efficient Method for Solving the Multiple Closed Curve Detection Problem.In Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-351-3, pages 269-276. DOI: 10.5220/0007238902690276

in Bibtex Style

@conference{icpram19,
author={Una Radojičić and Rudolf Scitovski and Kristian Sabo},
title={A Fast and Efficient Method for Solving the Multiple Closed Curve Detection Problem},
booktitle={Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2019},
pages={269-276},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007238902690276},
isbn={978-989-758-351-3},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - A Fast and Efficient Method for Solving the Multiple Closed Curve Detection Problem
SN - 978-989-758-351-3
AU - Radojičić U.
AU - Scitovski R.
AU - Sabo K.
PY - 2019
SP - 269
EP - 276
DO - 10.5220/0007238902690276