Curvature estimation along noisy digital contours by approximate global optimization
From MaRDI portal
Publication:834265
DOI10.1016/j.patcog.2008.11.013zbMath1192.68581OpenAlexW2064534152MaRDI QIDQ834265
Bertrand Kerautret, Jacques-Olivier Lachaud
Publication date: 19 August 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00345783/file/main.pdf
Related Items (11)
Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results ⋮ An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Regularization of discrete contour by Willmore energy ⋮ On the beneficial effect of noise in vertex localization ⋮ Robust and Convergent Curvature and Normal Estimators with Digital Integral Invariants ⋮ Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs ⋮ Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects ⋮ Shape Analysis with Geometric Primitives ⋮ Multigrid-convergence of digital curvature estimators ⋮ An alternative definition for digital convexity ⋮ Comparison and improvement of tangent estimators on digital curves
Cites Work
- A geometric model for active contours in image processing
- A new algorithm for dominant points detection and polygonization of digital curves.
- Exponential Sums and Lattice Points
- Discrete Geometry for Computer Imagery
- Discrete Geometry for Computer Imagery
- Robust Estimation of Curvature along Digital Contours with Global Optimization
- Multigrid convergence of calculated features in image analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Curvature estimation along noisy digital contours by approximate global optimization