The adaptation of the k-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.

DOI10.21136/AM.2019.0262-18MaRDI QIDQ2280464zbMATH OpenOpenAlexFDO

Authors Rudolf Scitovski, Kristian Sabo

Publication date 18 December 2019

Published in Applications of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21136/am.2019.0262-18

zbMATH Keywords

DIRECT\(k\)-meansLipschitz continuous functionglobally optimal \(k\)-partitionmultiple ellipses detection problem

Mathematics Subject Classification ID

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

Recommendations

• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
• Multiple ellipses detection in noisy environments: A hierarchical approach
• Fast approach of randomized detection for multi-ellipse
• An improved randomized algorithm for detecting ellipses based on least square approach
• 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
• Multiple ellipse fitting by center-based clustering

Cites work

• scientific article; zbMATH DE number 3852234 (Why is no real title available?)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
• Additive scaling and the \texttt{DIRECT} algorithm
• 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
• Clustering ellipses for anomaly detection
• ElliFit: an unconstrained, non-iterative, least squares based geometric ellipse fitting method
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Interpretation and optimization of the \(k\)-means algorithm.
• Introduction to clustering large and high-dimensional data.
• Least-squares fitting of circles and ellipses
• Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
• Lipschitzian optimization without the Lipschitz constant
• Multiple ellipse fitting by center-based clustering
• One-dimensional center-based l 1-clustering method
• Pattern recognition.
• Simplicial global optimization

Cited in

(2)

• 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 method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets

Describes a project that uses

Uses Software

• SymDIRECT

This page was built for publication: The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.

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