Multiple ellipse fitting by center-based clustering
From MaRDI portal
(Redirected from Publication:2966434)
Recommendations
Cited in
(14)- Multiple ellipse fitting of densely connected contours
- Majorization Algorithms for Inspecting Circles, Ellipses, Squares, Rectangles, and Rhombi
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Clustering ellipses for anomaly detection
- Angle aided circle detection based on randomized Hough transform and its application in welding spots detection
- 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.
- 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
- Investigation of the optimal number of clusters by the adaptive EM algorithm
- Ellipse fitting via low-rank generalized multidimensional scaling matrix recovery
- Clustering via minimum volume ellipsoids
- Constrained ellipse fitting with center on a line
- The Hausdorff distance between some sets of points
- Cluster detection in noisy environment by using the modified EM algorithm
- Data clustering for circle detection
This page was built for publication: Multiple ellipse fitting by center-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966434)
