Digital Shape Analysis with Maximal Segments
Abstract
We show in this paper how a digital shape can be efficiently analyzed through the maximal segments defined along its digital contour. They are efficiently computable. They can be used to prove the multigrid convergence of several geometric estimators. Their asymptotic properties can be used to estimate the local amount of noise along the shape, through a multiscale analysis.
Type
Publication
Applications of Discrete Geometry and Mathematical Morphology, volume 7346 of Lecture Notes in Computer Science, pp 14-27, 2012, Springer, Cham.
Digital Geometry
Digital Straightness
Digital Straight Segment Recognition
Tangential Cover
Digital Contour
2D
Noise Detection
Asymptotic Digital Geometry
Authors
Professor of Computer Science
My research interests include digital geometry, geometry processing, image analysis, variational models and discrete calculus.