A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
type: Item
instance of: scholarly article
title: A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
zbMATH Open document ID: 1466.90080
author: Rudolf Scitovski
author: Snježana Majstorović
author: Kristian Sabo
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7340956
zbMATH Keywords: \texttt{RANSAC}
zbMATH Keywords: \texttt{DBSCAN}
zbMATH Keywords: multiple line detection problem
zbMATH Keywords: multiple circle detection problem
zbMATH Keywords: multiple ellipse detection problem
zbMATH Keywords: the most appropriate partition
zbMATH Keywords: modified \(k\)-means
describes a project that uses: Mathematica
describes a project that uses: SymDIRECT
describes a project that uses: WRS2
MaRDI profile type: Publication
full work available at URL: s10898-020-00950-8
OpenAlex ID: W3086808225
cites work: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
cites work: Incomplete total least squares
cites work: A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
cites work: Q4889854
cites work: Encyclopedia of optimization. In 6 vols.
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Q5317017
cites work: Multiple ellipse fitting by center-based clustering
cites work: Clustering ellipses for anomaly detection
cites work: A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: Simplicial Global Optimization
cites work: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
cites work: ElliFit: an unconstrained, non-iterative, least squares based geometric ellipse fitting method
cites work: A fast and efficient method for solving the multiple line detection problem
cites work: 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
cites work: A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
cites work: A deterministic global optimization using smooth diagonal auxiliary functions
cites work: Introduction to Global Optimization Exploiting Space-Filling Curves
cites work: Q3321259
cites work: Q3118895
DOI: 10.1007/S10898-020-00950-8
description: scientific article; zbMATH DE number 7340956