Measure of circularity for parts of digital boundaries and its fast computation

DOI10.1016/J.PATCOG.2009.06.014MaRDI QIDQ733129zbMATH OpenOpenAlexFDO

Authors Tristan Roussillon, Isabelle Sivignon, Laure Tougne

Publication date 15 October 2009

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2009.06.014

zbMATH Keywords

compactnesscomputational geometrydiscrete geometrydigital circlecircularity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• A Hu moment invariant as a shape circularity measure
• A probabilistic measure of circularity
• Computational and Structural Advantages of Circular Boundary Representation
• Computational and structural advantages of circular boundary representation
• State of the art of compactness and circularity measures

Cites work

• scientific article; zbMATH DE number 1187120 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• A Measure for Circularity of Digital Figures
• An elementary algorithm for digital arc segmentation
• An optimal algorithm for roundness determination on convex polygons
• Approximation algorithms for minimum-width annuli and shells
• Approximation by circles
• Computing circular separability
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Linear Programming in Linear Time When the Dimension Is Fixed
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Measure of circularity for parts of digital boundaries and its fast computation
• On the circle closest to a set of points
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• On-line construction of the convex hull of a simple polyline
• Real-time accurate circle fitting with occlusions
• Testing the quality of manufactured disks and balls
• The linear time recognition of digital arcs
• Use of the Hough transformation to detect lines and curves in pictures
• Voronoi diagrams from convex hulls

Cited in

(16)

• Measure of circularity for parts of digital boundaries and its fast computation
• Computational and Structural Advantages of Circular Boundary Representation
• State of the art of compactness and circularity measures
• On Three Constrained Versions of the Digital Circular Arc Recognition Problem
• Computational and structural advantages of circular boundary representation
• Numerical solution of a degenerate, diffusion reaction based biofilm growth model on structured non-orthogonal grids
• A projection-based method for shape measurement
• Fast circular arc segmentation based on approximate circularity and cuboid graph
• A probabilistic measure of circularity
• A Hu moment invariant as a shape circularity measure
• Digital straightness, circularity, and their applications to image analysis
• Topological relations between separating circles
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Grid anisotropy reduction for simulation of growth processes with cellular automaton
• On the recognition of digital circles in linear time
• Determining digital circularity using integer intervals

This page was built for publication: Measure of circularity for parts of digital boundaries and its fast computation

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