A high speed algorithm for circular object location
Pattern Recognition Letters
A modified Hough scheme for general circle location
Pattern Recognition Letters
A survey of the Hough transform
Computer Vision, Graphics, and Image Processing
On the recognition of digital circles in linear time
Computational Geometry: Theory and Applications
CVGIP: Image Understanding
Randomized Hough transform (RHT): basic mechanisms, algorithms, and computational complexities
CVGIP: Image Understanding
The linear time recognition of digital arcs
Pattern Recognition Letters
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Finding circles by an array of accumulators
Communications of the ACM
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
A two-step circle detection algorithm from the intersecting chords
Pattern Recognition Letters
An efficient randomized algorithm for detecting circles
Computer Vision and Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
An effective voting method for circle detection
Pattern Recognition Letters
Robust and Accurate Vectorization of Line Drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Applied Mathematics
Number-theoretic interpretation and construction of a digital circle
Discrete Applied Mathematics
Note: A note on the problem of reporting maximal cliques
Theoretical Computer Science
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
New Resolution Independent Measures of Circularity
Journal of Mathematical Imaging and Vision
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
Detection of circular arcs in a digital image using chord and sagitta properties
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Journal of Mathematical Imaging and Vision
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Determining Digital Circularity Using Integer Intervals
Journal of Mathematical Imaging and Vision
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Generalized perpendicular bisector and circumcenter
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Separating Point Sets by Circles, and the Recognition of Digital Disks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Binarization of color document images via luminance and saturation color features
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
A聽fast and efficient algorithm for circular arc segmentation is presented. The algorithm is marked by several novel features including approximate circularity for arc detection, cuboid graph defined by the detected arcs in the 3D parameter space, and resolving all delimited cliques in the cuboid graph to form larger arcs. As circular arcs present in a digitized document often deviate from the ideal conditions of digital circularity, we have loosened their radius intervals and center locations depending on an adaptive tolerance so as to detect the arcs by approximate circularity. The notion of approximate circularity is realized by modifying certain number-theoretic properties of digital circularity, which ensures that the isothetic deviation of each point in an input curve segment from the reported circle does聽not exceed the specified tolerance. Owing to integer computation and judiciousness of delimited cliques, the algorithm runs significantly fast even for very large images. Exhaustive experimentation with benchmark datasets demonstrate its speed, efficiency, and robustness.