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

DOI10.21857/YVJRDCQQ8YzbMath1461.65184OpenAlexW2972746365MaRDI QIDQ5219118

Una Radojičić, Rudolf Scitovski, Kristian Sabo

Publication date: 6 March 2020

Published in: Rad Hrvatske akademije znanosti i umjetnosti. Matematičke znanosti (Search for Journal in Brave)

Full work available at URL: https://hrcak.srce.hr/file/328282

zbMATH Keywords

locationnumber of clusterscenter-based clusteringmultiple line detection problemglobally optimal partition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Combinatorial optimization (90C27)

Related Items (2)

Incremental method for multiple line detection problem -- iterative reweighted approach ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem

This page was built for publication: A fast and efficient method for solving the multiple line detection problem