Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-Scale/Irregular Geometric Representation and Generalized Linear Programming
Résumé
The reconstruction of noisy digital shapes is a complex question and a lot of contributions have been proposed to address this problem , including blurred segment decomposition or adaptive tangential covering for instance. In this article, we propose a novel approach combining multi-scale and irregular isothetic representations of the input contour, as an extension of a previous work [Vacavant et al., A Combined Multi-Scale/Irregular Algorithm for the Vectorization of Noisy Digital Contours , CVIU 2013]. Our new algorithm improves the representation of the contour by 1-D intervals, and achieves afterwards the decomposition of the contour into maximal arcs or segments. Our experiments with synthetic and real images show that our contribution can be employed as a relevant option for noisy shape reconstruction.
Fichier principal
articleDGCI2017-RepresentationOfDigitalNoisyShapes.pdf (951.81 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...