A Generic and Parallel Algorithm for 2D Digital Curve Polygonal Approximation

Guillaume Damiand 1, 2, * David Coeurjolly 1
* Corresponding author
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 SIC
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this paper, we present a generic topological and geometrical framework which allows to define and control several parallel algorithms for 2D digital curve approximation. The proposed technique is based on combinatorial map simplifications guided by geometrical criteria. We illustrate the genericity of the framework by defining three contour simplification methods: a polygonal approximation one based an area deviation computation; a digital straight segments reconstruction one which guaranties to obtain a loss-less representation; and a moment preserving simplification one which simplifies the contours while preserving geometrical moments of the image regions. Thanks to a complete experimental evaluation, we demonstrate that the proposed methods can be efficiently implemented in a multi-thread environment to simplify labeled image contours.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00636402
Contributor : Guillaume Damiand <>
Submitted on : Thursday, October 27, 2011 - 2:02:47 PM
Last modification on : Thursday, November 1, 2018 - 1:19:42 AM
Long-term archiving on : Thursday, November 15, 2012 - 10:41:15 AM

File

parallel-reconstruction.pdf
Files produced by the author(s)

Identifiers

Citation

Guillaume Damiand, David Coeurjolly. A Generic and Parallel Algorithm for 2D Digital Curve Polygonal Approximation. Journal of Real-Time Image Processing, Springer Verlag, 2011, 6 (3), pp.145-157. ⟨10.1007/s11554-011-0193-x⟩. ⟨hal-00636402⟩

Share

Metrics

Record views

372

Files downloads

340