A high speed algorithm for circular object location
Pattern Recognition Letters
A modified Hough scheme for general circle location
Pattern Recognition Letters
On the convex hull of the integer points in a disc
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On the recognition of digital circles in linear time
Computational Geometry: Theory and Applications
CVGIP: Image Understanding
The linear time recognition of digital arcs
Pattern Recognition Letters
Information Sciences: an International Journal
Sparse Pixel Vectorization: An Algorithm and Its Performance Evaluation
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
A two-step circle detection algorithm from the intersecting chords
Pattern Recognition Letters
Theoretical Computer Science
Digital Image Processing
Digital Picture Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Discrete Analytical Hyperspheres
IEEE Transactions on Visualization and Computer Graphics
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Curvature Based on Osculating Circle Estimation
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Digital disks and a digital compactness measure
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
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)
Connectivity of discrete planes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
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
On the polyhedral complexity of the integer points in a hyperball
Theoretical Computer Science
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
On three constrained versions of the digital circular arc recognition problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Arithmetization of a circular arc
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Robust and precise circular arc detection
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
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
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalized perpendicular bisector and circumcenter
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Digital Circularity and Its Applications
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On covering a digital disc with concentric circles in Z2
Theoretical Computer Science
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
Digital circularity is a well-researched topic for its real-world practicality to circularity measure, estimation of discrete curvature, circular arc segmentation, etc. The proposed work reveals a novel technique to determine whether a digital curve segment is digitally circular using the correspondence of its constituent runs with the square numbers in integer intervals. The notion of radii nesting is used to successively analyze these runs of digital points. Two algorithms have been proposed along with their demonstrations and detailed analysis, and a simple-yet-effective solution has been provided to expedite them using infimum circle and supremum circles that bound the initial range of radii. We have also shown how the proposed technique can be used for segmentation of an arbitrary digital curve segment into a sequence of circular arcs. Experimental results have been given to demonstrate the efficiency and elegance of the proposed technique.