A two-step circle detection algorithm from the intersecting chords
DOI10.1016/S0167-8655(01)00020-4zbMATH Open1010.68892OpenAlexW2062551944WikidataQ126323818 ScholiaQ126323818MaRDI QIDQ4795084FDOQ4795084
Authors: Heung-Soo Kim, Jonghwan (Simon) Kim 
Publication date: 20 February 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(01)00020-4
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
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Machine vision and scene understanding (68T45)
Cited In (11)
- On covering a digital disc with concentric circles in \(\mathbb Z^2\)
- Algorithmic detection of hypercircles
- Digital straightness, circularity, and their applications to image analysis
- Number-theoretic interpretation and construction of a digital circle
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Determining digital circularity using integer intervals
- Optimization of an Hough transform algorithm for the search of a center
- Title not available (Why is that?)
- Subpixel determination of imperfect circles characteristics
- Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform
- A primitive-based 3D segmentation algorithm for mechanical CAD models
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)
