A fast sequential method for polygonal approximation of digitized curves
Computer Vision, Graphics, and Image Processing
Computational geometry: an introduction
Computational geometry: an introduction
On Image Analysis by the Methods of Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
A topologically consistent representation for image analysis: the Topological Graph of Frontiers
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Split-and-merge algorithms defined on topological maps for 3D image segmentation
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Computer Vision and Image Understanding
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Topological model for 3D image representation: Definition and incremental extraction algorithm
Computer Vision and Image Understanding
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
A Generic and Parallel Algorithm for 2D Image Discrete Contour Reconstruction
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
A polyhedron representation for computer vision
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
First results for 3D image segmentation with topological map
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
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.