A two-step circle detection algorithm from the intersecting chords
From MaRDI portal
Publication:4795084
Recommendations
- An efficient randomized algorithm for detecting circles
- A Hybrid Approach Based Hough Transform and Connected Component Analysis for Circular Objects Detection and Measurement
- Using tow-steps Hough transform to detection ellipses
- A new approach for circle detection on multiprocessors
- Data clustering for circle detection
Cited in
(11)- Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform
- Optimization of an Hough transform algorithm for the search of a center
- Algorithmic detection of hypercircles
- scientific article; zbMATH DE number 5137290 (Why is no real title available?)
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Digital straightness, circularity, and their applications to image analysis
- A primitive-based 3D segmentation algorithm for mechanical CAD models
- On covering a digital disc with concentric circles in \(\mathbb Z^2\)
- Number-theoretic interpretation and construction of a digital circle
- Subpixel determination of imperfect circles characteristics
- Determining digital circularity using integer intervals
This page was built for publication: A two-step circle detection algorithm from the intersecting chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4795084)