Multiple ellipse fitting by center-based clustering
From MaRDI portal
Publication:2966434
DOI10.17535/CRORR.2015.0004zbMATH Open1359.62256OpenAlexW1500897668MaRDI QIDQ2966434FDOQ2966434
Tomislav Marošević, Rudolf Scitovski
Publication date: 7 March 2017
Published in: Croatian operational research review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2015.0004
Recommendations
Cited In (12)
- 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
- Title not available (Why is that?)
- Clustering ellipses for anomaly detection
- Cluster Detection in the Noisy Environment by Using the Modified EM Algorithm
- 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
- Clustering via minimum volume ellipsoids
- Constrained ellipse fitting with center on a line
Uses Software
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)
