Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform

DOI10.1016/j.amc.2007.01.012zbMath1136.68053MaRDI QIDQ2383740

Yanyan Li

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.012

zbMATH Keywords

circles; randomized algorithms; lines; ellipses; Bresenham's drawing paradigm

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

68T10: Pattern recognition, speech recognition

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

68W20: Randomized algorithms

68T45: Machine vision and scene understanding

Related Items

Orientation-based discrete Hough transform for line detection with low computational complexity, A novel color detection method based on HSL color space for robotic soccer competition, Fast incremental algorithm for speeding up the computation of binarization

Cites Work

• Unnamed Item
• Generalizing the Hough transform to detect arbitrary shapes
• Accurate and efficient curve detection in images: the importance sampling Hough transform
• An Efficient Randomized Algorithm for Detecting Circles
• Randomized or probabilistic Hough transform: unified performance evaluation
• Use of the Hough transformation to detect lines and curves in pictures
• Finding circles by an array of accumulators
• A linear algorithm for incremental digital display of circular arcs
• Randomized Hough Transform: Improved ellipse detection with comparison
• A new curve detection method: Randomized Hough transform (RHT)
• Local Lines: A linear time line detector
• Detecting line segments in an image – a new implementation for Hough Transform
• A two-step circle detection algorithm from the intersecting chords
• Error propagation for the Hough transform