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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Lachaud, J. O. (2012). Digital shape analysis with maximal segments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7346 LNCS, pp. 14–27). https://doi.org/10.1007/978-3-642-32313-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
