A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem

DOI10.1007/s10898-020-00950-8zbMath1466.90080OpenAlexW3086808225MaRDI QIDQ2022324

Kristian Sabo, Rudolf Scitovski, Snježana Majstorović

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00950-8

zbMATH Keywords

modified \(k\)-meansmultiple line detection problem\texttt{DBSCAN}\texttt{RANSAC}multiple circle detection problemmultiple ellipse detection problemthe most appropriate partition

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Uses Software

• Mathematica
• WRS2
• SymDIRECT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Clustering ellipses for anomaly detection
• A deterministic global optimization using smooth diagonal auxiliary functions
• Incomplete total least squares
• Lipschitzian optimization without the Lipschitz constant
• A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
• ElliFit: an unconstrained, non-iterative, least squares based geometric ellipse fitting method
• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
• Globally-biased disimpl algorithm for expensive global optimization
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
• Introduction to Global Optimization Exploiting Space-Filling Curves
• Simplicial Global Optimization
• Multiple ellipse fitting by center-based clustering
• A fast and efficient method for solving the multiple line detection problem
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints

This page was built for publication: A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem