Data clustering for circle detection
From MaRDI portal
Publication:2966424
Recommendations
- Multiple ellipse fitting by center-based clustering
- 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 \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Solution methods of clustering 2D-objects into a circle of the minimal radius
Cites work
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3852234 (Why is no real title available?)
- scientific article; zbMATH DE number 4098590 (Why is no real title available?)
- scientific article; zbMATH DE number 782090 (Why is no real title available?)
- A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
- A toolbox for \(K\)-centroids cluster analysis
- An information-theoretic fuzzy C-spherical shells clustering algorithm
- Data Clustering: Theory, Algorithms, and Applications
- Fitting concentric circles to measurements
- Introduction to clustering large and high-dimensional data.
- Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
- Locating a circle on the plane using the minimax criterion
- Locating a minisum circle in the plane
- Median spheres: Theory, algorithms, applications
- On the circle closest to a set of points
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Three points method for searching the best least absolute deviations plane
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
Cited in
(7)- Segmentation of circular data
- A two-step circle detection algorithm from the intersecting chords
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Clustering ellipses for anomaly detection
- Localization of circular objects
- Cluster detection in noisy environment by using the modified EM algorithm
- The Hausdorff distance between some sets of points
This page was built for publication: Data clustering for circle detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966424)
