Incremental method for multiple line detection problem — iterative reweighted approach

Kristian Sabo, Danijel Grahovac and Rudolf Scitovski

Mathematics and Computers in Simulation (MATCOM), 2020, vol. 178, issue C, 588-602

Abstract: In this paper we consider the multiple line detection problem by using the center-based clustering approach, and propose a new incremental method based on iterative reweighted approach. We prove the convergence theorem and construct an appropriate algorithm which we test on numerous artificial data sets. A stopping criterion in the algorithm is defined by using the parameters from the DBSCAN algorithm. We give necessary conditions for the most appropriate partition, which have been used during elimination of unacceptable center-lines that appear in the output of the algorithm. The algorithm is also illustrated on a real-world image coming from Precision Agriculture.

Keywords: Multiple line detection problem; DBSCAN; Incremental algorithm; The most appropriate partition; Modified k-means (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475420302421
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:178:y:2020:i:c:p:588-602

DOI: 10.1016/j.matcom.2020.07.013

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().