Polygonal approximation of digital planar curves through break point suppression
From MaRDI portal
Publication:733122
DOI10.1016/J.PATCOG.2009.06.010zbMath1192.68559OpenAlexW2072072559MaRDI QIDQ733122
R. Medina-Carnicer, F. J. Madrid-Cuevas, A. Carmona-Poyato, Rafael Muñoz-Salinas
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.010
Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Approximation by polynomials (41A10)
Related Items (3)
Some algorithms under non-parametric framework versus an unsupervised approach ⋮ SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION ⋮ Polygonal approximation using integer particle swarm optimization
Uses Software
Cites Work
- Coarse-to-fine planar object identification using invariant curve features and \(B\)-spline modeling
- A curve bend function based method to characterize contour shapes
- ACORD -- an adaptive corner detector for planar curves
- An adaptive method for detecting dominant points.
- A new algorithm for dominant points detection and polygonization of digital curves.
- Extraction of dominant points by estimation of the contour fluctuations
- Optimized polygonal approximation by dominant point deletion
- Corner detection and curve segmentation by multiresolution chain-code linking
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Another look at the dominant point detection of digital curves
- Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data
- 2D object recognition based on curvature functions obtained from local histograms of the contour chain code
- Planar shape recognition by directional flow-change method
- Optimum polygonal approximation of digitized curves
- Improving fitting quality of polygonal approximation by using the dynamic programming technique
- Non-parametric planar shape representation based on adaptive curvature functions
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
This page was built for publication: Polygonal approximation of digital planar curves through break point suppression
