Thinning-free Polygonal Approximation of Thick Digital Curves Using Cellular Envelope
- Autores: Partha Bhowmick, Arindam Biswas, Bhargab B. Bhattacharya
- Localización: ELCVIA. Electronic letters on computer vision and image analysis, ISSN-e 1577-5097, Vol. 7, Nº. Extra 2, 2008 (Ejemplar dedicado a: Special Issue on Computational Modelling of Objects Represented in Images), págs. 76-95
- Idioma: inglés
- Enlaces
-
Resumen
Since the inception of successful rasterization of curves and objects in the digital space, several algorithmshave been proposed for approximating a given digital curve. All these algorithms, however, resort tothinning as preprocessing before approximating a digital curve with changing thickness. Described in thispaper is a novel thinning-free algorithm for polygonal approximation of an arbitrarily thick digital curve,using the concept of “cellular envelope”, which is newly introduced in this paper. The cellular envelope,defined as the smallest set of cells containing the given curve, and hence bounded by two tightest (inner andouter) isothetic polygons, is constructed using a combinatorial technique. This envelope, in turn, is analyzedto determine a polygonal approximation of the curve as a sequence of cells using certain attributes of digitalstraightness. Since a real-world curve=curve-shaped object with varying thickness, unexpected disconnectedness,noisy information, etc., is unsuitable for the existing algorithms on polygonal approximation, thecurve is encapsulated by the cellular envelope to enable the polygonal approximation. Owing to the implicitEuclidean-free metrics and combinatorial properties prevailing in the cellular plane, implementationof the proposed algorithm involves primitive integer operations only, leading to fast execution of the algorithm.Experimental results that include output polygons for different values of the approximation parametercorresponding to several real-world digital curves, a couple of measures on the quality of approximation,comparative results related with two other well-referred algorithms, and CPU times, have been presented todemonstrate the elegance and efficacy of the proposed algorithm.
