 |
 |
|
|
| HAL: hal-00579467, version 1 |
| Detailed view |  Export this paper |
 |
| Discrete Geometry for Computer Imagery, Nancy : France (2011) |
|
|
|
|
| Circular arc reconstruction of digital contours with chosen Hausdorff error |
|
|
| Bertrand Kerautret 1, 2Jacques-Olivier Lachaud 2 |
|
|
| (2011-04-06) |
|
|
|
| We address the problem of constructing an approximate continuous representation of a digital contour with guarantees on the Hausdorff error between the digital shape and its reconstruction. Instead of polygonalizing the contour, we propose to reconstruct the shape with circular arcs. To do so, we exploit the recent curvature estimators. From their curvature field, we introduce a new simple and efficient algorithm to approximate a digital shape with as few arcs as possible at a given scale, specified by a maximal admissible Hausdorff distance. We show the potential of our reconstruction method with numerous experiments and we also compare our results with some recent promising approaches. Last, all these algorithms are available online for comparisons on arbitrary shapes. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | ADAGIO (LORIA) |
|
|
|
CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – INRIA – Institut National Polytechnique de Lorraine (INPL) |
|
|
| 2: | Laboratoire de Mathématiques (LAMA) |
|
|
|
CNRS : UMR5127 – Université de Savoie |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Image Processing |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00579467, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00579467 | |
| oai:hal.archives-ouvertes.fr:hal-00579467 | |
| From: Bertrand Kerautret | |
| Submitted on: Wednesday, 23 March 2011 22:41:56 | |
| Updated on: Thursday, 24 March 2011 08:59:03 | |
