Finding circles by an array of accumulators

DOI10.1145/360666.360677MaRDI QIDQ4050200zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050200)