Measure of circularity for parts of digital boundaries and its fast computation
From MaRDI portal
Publication:733129
DOI10.1016/J.PATCOG.2009.06.014zbMATH Open1192.68606OpenAlexW2006011108MaRDI QIDQ733129FDOQ733129
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
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
Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Use of the Hough transformation to detect lines and curves in pictures
- Linear Programming in Linear Time When the Dimension Is Fixed
- A Measure for Circularity of Digital Figures
- Voronoi diagrams from convex hulls
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Title not available (Why is that?)
- Computing circular separability
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- An elementary algorithm for digital arc segmentation
- The linear time recognition of digital arcs
- 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
- Approximation algorithms for minimum-width annuli and shells
- Testing the quality of manufactured disks and balls
- An optimal algorithm for roundness determination on convex polygons
- Real-time accurate circle fitting with occlusions
- Title not available (Why is that?)
- Approximation by circles
Cited In (16)
- A projection-based method for shape measurement
- Measure of circularity for parts of digital boundaries and its fast computation
- Digital straightness, circularity, and their applications to image analysis
- State of the art of compactness and circularity measures
- A Hu moment invariant as a shape circularity measure
- On the recognition of digital circles in linear time
- Numerical solution of a degenerate, diffusion reaction based biofilm growth model on structured non-orthogonal grids
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Determining digital circularity using integer intervals
- A probabilistic measure of circularity
- Faithful polygonal representation of the convex and concave parts of a digital curve
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- Computational and structural advantages of circular boundary representation
- Computational and Structural Advantages of Circular Boundary Representation
- Grid anisotropy reduction for simulation of growth processes with cellular automaton
- Topological relations between separating circles
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)
