Search

A Skeleton that is extracted by a skeletonization algorithm from a binary image is useful for object description, matching, recognition and compression. The parallel thinning algorithm, one of the skeletonization algorithms is well known to have computational effciency. The main contribution of this paper is that we proposed a novel fully parallel thinning algorithm based on a comprehensive investigation of the well-known Zhang-Suen (ZS)-series algorithms and the one-pass thinning algorithm (OPTA)-series algorithms, which not only has good performance in terms of (8,4) connectivity preservation and single-pixel thickness, but also has the following qualities: it is more robust to the boundary noise than the OPTA-series algorithms and it is faster than the ZS-series algorithms in terms of thinning speed, as confirmed by the experiments presented in this paper. [ABSTRACT FROM AUTHOR]

Thinning is one of the most important techniques in the field of image processing. It is applied to erode the image of an object layer-by-layer until a skeleton is left. Several thinning algorithms allowing to get a skeleton of a binary image are already proposed in the literature. This paper investigates several well-known parallel thinning algorithms and proposes a modified version of the most widely used thinning algorithm, called the ZS algorithm. The proposed modified ZS (MZS) algorithm is implemented and compared against seven existing algorithms. Experimental results and performances evaluation, using different image databases, confirm the proposed MZS algorithm improvement over the seven examined algorithms both in terms of the obtained results quality and the computational speed. Moreover, for an efficient implementation (on Graphics Processing Units), a parallel model of the MZS algorithm is proposed (using the Compute Unified Device Architecture, CUDA, as a parallel programming model). Evaluation results have shown that the parallel version of the proposed algorithm is, on average, more than 21 times faster than the traditional CPU sequential version. [ABSTRACT FROM AUTHOR]

Abstract: Thinning is a silvicultural practice to improve tree growth and health. Thinning from below for the even-aged silviculture and thinning from above for the uneven-aged silviculture are the two mainly applied thinning practices. In forest management simulations, algorithms that describe which individual trees to be removed from a forest have developed in five growth simulators (). We have developed a shifting algorithm that determines the proportion of trees to be thinned from different diameter classes to complement the individual tree selection algorithms. Sampled (or mapped) tree diameters are grouped into diameter classes. Given the target thinning volume, the algorithm automatically computes the thinning rate in each of the diameter classes using the three-parameter Weibull distribution. The thinning rate is obtained by shifting the location parameter of an estimated Weibull distribution either to the right or to the left for thinnings from below and above, respectively. A modified bisection method is used to search for the new location parameter that yields the desired thinning volume. The proposed algorithm is demonstrated in examples by using experimental forest datasets. A stand-alone program called Weibull_thinning is downloadable at http://www.it.abo.fi/suswood/weibull_thinning/. [ABSTRACT FROM AUTHOR]