A new algorithm for dominant points detection and polygonization of digital curves.
From MaRDI portal
Publication:1403782
DOI10.1016/S0031-3203(03)00119-5zbMath1054.68156OpenAlexW2067607730MaRDI QIDQ1403782
Publication date: 4 September 2003
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0031-3203(03)00119-5
Related Items (13)
Curvature estimation along noisy digital contours by approximate global optimization ⋮ Cubic Bézier approximation of a digitized curve ⋮ Automatic segmentation of metaphase cells based on global context and variant analysis ⋮ Optimized polygonal approximation by dominant point deletion ⋮ A discrete geometry approach for dominant point detection ⋮ HFES: A Height Function Method with Explicit Input and Signed Output for High-Order Estimations of Curvature and unit Vectors of Planar Curves ⋮ Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs ⋮ A unified curvature definition for regular, polygonal, and digital planar curves ⋮ Dominant point detection based on discrete curve structure and applications ⋮ Vectorizing outlines of generic shapes by cubic spline using simulated annealing ⋮ Polygonal approximation of digital planar curves through break point suppression ⋮ Approximation of virus structure by icosahedral tilings ⋮ Comparison and improvement of tangent estimators on digital curves
Cites Work
- Unnamed Item
- Localization of dominant points for object recognition: A scale-space approach
- Boundary-based corner detection using neural networks
- Curve fitting approach for tangent angle and curvature measurements
- A curve bend function based method to characterize contour shapes
- Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature
- 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
- Parallel algorithm for corner finding on digital curves
- Corner detection and curve representation using cubic B-splines
- Determining local natural scales of curves
- An adaptive dominant point detection algorithm for digital curves
- Non-parametric planar shape representation based on adaptive curvature functions
- Reduced resolution and scale space for dominant feature detection in contours
This page was built for publication: A new algorithm for dominant points detection and polygonization of digital curves.