A two-step circle detection algorithm from the intersecting chords
From MaRDI portal
Publication:4795084
DOI10.1016/S0167-8655(01)00020-4zbMath1010.68892OpenAlexW2062551944WikidataQ126323818 ScholiaQ126323818MaRDI QIDQ4795084
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
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Machine vision and scene understanding (68T45)
Related Items (9)
A primitive-based 3D segmentation algorithm for mechanical CAD models ⋮ Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform ⋮ Subpixel determination of imperfect circles characteristics ⋮ On covering a digital disc with concentric circles in \(\mathbb Z^2\) ⋮ Determining digital circularity using integer intervals ⋮ Optimization of an Hough transform algorithm for the search of a center ⋮ Number-theoretic interpretation and construction of a digital circle ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph
This page was built for publication: A two-step circle detection algorithm from the intersecting chords
