Finding circles by an array of accumulators

DOI10.1145/360666.360677zbMath0296.68099OpenAlexW2069853858MaRDI QIDQ4050200

Carolyn Kimme, Dana H. Ballard, Jack Sklansky

Publication date: 1975

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360666.360677

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) General topics in the theory of software (68N01)

Related Items (13)

A Fisher-Rao metric for curves using the information in edges ⋮ Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform ⋮ A parameterized Hough transform approach for estimating the support of the wideband spreading function of a distributed object ⋮ Handling uncertain data in subspace detection ⋮ A formal definition of the Hough transform: properties and relationships ⋮ Generalizing the Hough transform to detect arbitrary shapes ⋮ A general framework for subspace detection in unordered multidimensional data ⋮ Optimal consensus set for digital flake hyperspheres in \(n\)D ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ A sweep-line algorithm for the inclusion hierarchy among circles ⋮ A unified scheme for detecting fundamental curves in binary edge images ⋮ On the detection of structures in noisy pictures ⋮ Feature space transforms for curve detection

This page was built for publication: Finding circles by an array of accumulators