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

DOI10.1007/S10898-020-00950-8zbMATH Open1466.90080OpenAlexW3086808225MaRDI QIDQ2022324FDOQ2022324

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Lipschitzian optimization without the Lipschitz constant
• Encyclopedia of optimization. In 6 vols.
• Globally-biased disimpl algorithm for expensive global optimization
• Introduction to Global Optimization Exploiting Space-Filling Curves
• A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
• A deterministic global optimization using smooth diagonal auxiliary functions
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• Simplicial Global Optimization
• Multiple ellipse fitting by center-based clustering
• Clustering ellipses for anomaly detection
• ElliFit: an unconstrained, non-iterative, least squares based geometric ellipse fitting method
• Incomplete total least squares
• 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
• A fast and efficient method for solving the multiple line detection problem
• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem

Cited In (2)

• A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
• DT-RANSAC: A Delaunay Triangulation Based Scheme for Improved RANSAC Feature Matching

Uses Software

• Mathematica
• WRS2
• SymDIRECT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022324)